Journal of Integer Sequences, Vol. 21 (2018), Article 18.5.2

Pascal Matrices and Restricted Words

Milan Janjić
Department of Mathematics and Informatics
University of Banja Luka
Banja Luka, 78000
Republic of Srpska, BA


In previous papers we examined two functions fm and cm, related to the enumeration of restricted words over a finite alphabet. The definitions of these functions depend on an initial arithmetic function f0 taking nonnegative integer values. In this paper, we consider four types of initial functions, the values of which are binomial coefficients. In particular, we give a new combinatorial interpretation of the figurate numbers.

Full version:  pdf,    dvi,    ps,    latex    

(Concerned with sequences A000302 A002011 A002457 A002478 A002697 A008549 A015237 A026671 A035324 A035330 A045720 A045894 A049027 A052529 A054000 A054335 A055991 A079675 A086950 A099234 A116088 A116089 A127893 A175925 A200676.)

Received March 3 2018; revised versions received May 10 2018; May 11 2018. Published in Journal of Integer Sequences, May 24 2018.

Return to Journal of Integer Sequences home page