|
|
A178666
|
|
Irregular triangle read by rows in which row n gives expansion of the polynomial Product_{k=0..n} (1 + x^(2*k + 1)), n >= -1.
|
|
9
|
|
|
1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3, 3, 3, 2, 2, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 3, 4, 4, 5, 4, 4, 5, 5, 4, 4, 5, 4, 4, 3, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
-1,27
|
|
COMMENTS
|
T(n, k) is the number of partitions of k into distinct odd parts not larger than 2*n+1. Also, the number of self-conjugate partitions of k into at most n+1 parts. Also, the number of self-conjugate partitions of 2*n+k+3 into exactly n+2 parts.
Rows are symmetric: T(n, k) = T(n, (n+1)^2 - k).
Within the range 0 <= k <= (n+1)^2, T(n, k) = 0 iff k = 2 or k = (n+1)^2 - 2.
(End)
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = Sum_{i < n} T(i, k - 2*i - 3), if k > 0.
T(n, k) = A000700(k), if k <= 2*(n+1).
(End)
|
|
EXAMPLE
|
Triangle begins:
[1] (the empty product)
[1, 1]
[1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3, 3, 3, 2, 2, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 3, 4, 4, 5, 4, 4, 5, 5, 4, 4, 5, 4, 4, 3, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 0, 1, 1]
...
|
|
MAPLE
|
T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(
mul(1 + x^(2*k + 1), k=0..n)):
|
|
MATHEMATICA
|
Flatten[Table[CoefficientList[Product[1+x^(2k+1), {k, 0, n}], x], {n, -1, 6}]] (* Jean-François Alcover, May 23 2011 *)
|
|
PROG
|
(PARI)
row(n)={Vec(prod(k=0, n, 1+x^(2*k+1)))}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|