|
Search: id:A116681
|
|
|
| A116681 |
|
Triangle read by rows: T(n,k) is the number of partitions of n into distinct parts, in which the sum of the odd parts is k (n>=0, 0<=k<=n). |
|
+0
3
|
|
| 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 2, 3, 0, 0, 0, 2, 0, 1, 0, 2, 0, 2, 0, 3, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 4, 0, 0, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 4, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3
(list; table; graph; listen)
|
|
|
OFFSET
|
0,22
|
|
|
COMMENT
|
Row sums yield A000009. T(2n,0)=A000009(n), T(2n-1,0)=0. T(2n,1)=0, T(2n+1,1)=A000009(n), T(n,2)=0. T(n,n)=A000700(n). Sum(k*T(n,k), k=0..n)=A116682(n).
|
|
FORMULA
|
G.f.=product((1+tx^(2j-1))(1+x^(2j)), j=1..infinity).
|
|
EXAMPLE
|
T(10,4)=2 because we have [6,3,1] and [4,3,2,1].
Triangle starts:
1;
0,1;
1,0,0;
0,1,0,1;
1,0,0,0,1;
0,1,0,1,0,1;
|
|
MAPLE
|
g:=product((1+(t*x)^(2*j-1))*(1+x^(2*j)), j=1..30): gser:=simplify(series(g, x=0, 20)): P[0]:=1: for n from 1 to 15 do P[n]:=sort(coeff(gser, x^n)) od: for n from 0 to 15 do seq(coeff(P[n], t, j), j=0..n) od; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A000009, A035457, A036469, A116676.
Sequence in context: A070140 A081212 A085491 this_sequence A131371 A003475 A135767
Adjacent sequences: A116678 A116679 A116680 this_sequence A116682 A116683 A116684
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 22 2006
|
|
|
Search completed in 0.002 seconds
|
