|
|
A177701
|
|
Triangle of coefficients of polynomials P_n(z) defined by the recursion P_0(z) = z+1; for n>=1, P_n(z) = z + Product_{k=0..n-1} P_k(z).
|
|
2
|
|
|
1, 1, 2, 1, 2, 4, 1, 4, 14, 16, 8, 1, 16, 112, 324, 508, 474, 268, 88, 16, 1, 256, 3584, 22912, 88832, 233936, 443936, 628064, 675456, 557492, 353740, 171644, 62878, 17000, 3264, 416, 32, 1, 65536, 1835008, 24576000, 209715200, 1281482752, 5974786048, 22114709504, 66752724992
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Length of the first row is 2; for i>=2, length of the i-th row is 2^{i-2}+1.
|
|
LINKS
|
|
|
FORMULA
|
Another recursion is: P_n(z)=z+P_(n-1)(z)(P_(n-1)(z)-z).
|
|
EXAMPLE
|
Triangle begins:
1, 1;
2, 1;
2, 4, 1;
4, 14, 16, 8, 1;
16, 112, 324, 508, 474, 268, 88, 16, 1;
|
|
MAPLE
|
p:= proc(n) option remember;
z-> z+ `if`(n=0, 1, p(n-1)(z)*(p(n-1)(z)-z))
end:
deg:= n-> `if`(n=0, 1, 2^(n-1)):
T:= (n, k)-> coeff(p(n)(z), z, deg(n)-k):
|
|
MATHEMATICA
|
P[0][z_] := z + 1;
P[n_][z_] := P[n][z] = z + Product[P[k][z], {k, 0, n-1}];
row[n_] := CoefficientList[P[n][z], z] // Reverse;
|
|
CROSSREFS
|
Cf. A000058, A000215, A000289, A000324, A001543, A001544, A067686, A110360, A000027, A005408, A056220, A177888. First column gives: A165420.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|