Chebyshev Polynomials, Sliding Columns, and the k-step Fibonacci Numbers

DOI10.1080/0025570X.2023.2165860MaRDI QIDQ6392114arXivFDO

Authors Greg Dresden

Publication date 24 February 2022

Published in arXiv

Full work available at URL https://doi.org/10.1080/0025570X.2023.2165860

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

arXiv classification

math.COmath.NT

Abstract: We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the Fibonaccis, the Tribonaccis, the Tetranaccis, and so on.

This page was built for publication: Chebyshev Polynomials, Sliding Columns, and the $k$-step Fibonacci Numbers

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