|
|
A081265
|
|
Triangle of coefficients of the polynomials a(n, x) = 2*a(n-1, x)+ x^2*a(n-2,x), n >= 1, a(0, x) = 1, a(1, x) = 1.
|
|
2
|
|
|
1, 1, 0, 2, 0, 1, 4, 0, 3, 0, 8, 0, 8, 0, 1, 16, 0, 20, 0, 5, 0, 32, 0, 48, 0, 18, 0, 1, 64, 0, 112, 0, 56, 0, 7, 0, 128, 0, 256, 0, 160, 0, 32, 0, 1, 256, 0, 576, 0, 432, 0, 120, 0, 9, 0, 512, 0, 1280, 0, 1120, 0, 400, 0, 50, 0, 1, 1024, 0, 2816, 0, 2816, 0, 1232, 0, 220
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
For the Riordan coefficient triangle for Chebyshev's T-polynomials (decreasing odd or even powers of x) see A039991. - Wolfdieter Lang, Aug 06 2014
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = [x^k] a(n,x), k = 0, 1, ..., n, with polynomial a(n,x) defined by the recurrence given as name. Its Binet-de Moivre form is a(n, x) = ((1+sqrt(x^2+1))^n + (1-sqrt(x^2+1))^n)/2.
O.g.f. for row polynomials a(n,x): (1-z)/(1 - 2*z - (x*z)^2). Compare with A039991.
|
|
EXAMPLE
|
Triangle rows are {1}, {1,0}, {2,0,1}, {4,0,3,0}, {8,0,8,0,1},.... [Corrected by Philippe Deléham, Dec 27 2007]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Edited. Name and formula clarified. G.f. of row polynomial, and crossref. A039991 added. - Wolfdieter Lang, Aug 06 2014
|
|
STATUS
|
approved
|
|
|
|