scientific article; zbMATH DE number 3305965

From MaRDI portal
Publication:5587199





The sequence of generalized Fibonacci numbers \(u_n(p,q,s)\) where \(n\), \(p\), \(q\), \(s\) are non-negative integers as developed by \textit{V. C. Harris} and \textit{C. C. Styles} [Fibonacci Q. 4, 241--248 (1966; Zbl 0147.02203)] is given by \[ \sum_{n=0}^\infty u_n(p,q,s)] x^n = \frac{(1 - x^s)^q/(1 - x)}{(1 - x^s) - x^{p+sq}} = \sum_{n=0}^\infty \sum_{n=0}^{[n/(p+sq)]} \binom{[(n - ip)/s]}{iq} x^n \] where \([x]\) is the greatest integer in \(x\). If Pascal's binomial triangle is written (left-justified) but each row is repeated \(s\) times, then \(u_n(p,q,s)\) is the sum of the term in the first column and \(n\)-th row and the terms obtained by starting from this term and taking steps \(p\) units up and \(q\) units right. When \(s =1\), the triangle is Pascal's triangle and each \(u_n(p,q,1) = u(n;p,q)\) represents the sum of a rising diagonal there. The numbers \(u_n(1,1,1)\) are the Fibonacci numbers \(1,1,2,3,5,8,13,\ldots\). In this paper, the case \(s =1\) is developed when Pascal's binomial coefficient triangle is generalized to trinomial and other polynomial coefficient arrays, given by the coefficients of \[ (1+x+x^2+\cdots+x^{r-1})^n,\qquad n=0, 1, 2,\ldots, r\ge 2. \] Polya's method [\textit{G. Pólya}, Mathematical discovery, Vol. I: On understanding, learning, and teaching problem solving. New York etc.: John Wiley (1962; Zbl 0101.24103)] of vertical summing to find the sum of \(n\) terms of a sequence is applied to the generating functions of each column of the array, yielding a procedure for finding the sums of terms along any rising diagonal in any such array. The utility of generating functions is well-known; here, the main effort is to extend the list of known generating functions in a Fibonacci-related area. Formulas, in terms of generating functions, are given for special cases, and the trinomial and quadrinomial triangles have an explicit solution for \(u(n;p,q)\) for all nonnegative integers \(n\), \(p\); \(q=b^2\). A procedure using symmetric functions of the roots of an equation is developed to find \(u(n;p,q)\) for any polynomial triangle. The numbers \(u_n(p,q,s)\) for generalized Pascal's triangles were not discussed. [In the correction the formulas lines 11 and 12 are corrected.]











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5587199)