|
Search: id:A113685
|
|
|
| A113685 |
|
Triangular array T(n,k)=number of partitions of n in which sum of odd parts is k, for k=0,1,...n; n>=0. |
|
+0
3
|
|
| 1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 3, 3, 0, 2, 0, 2, 0, 4, 0, 3, 0, 4, 0, 3, 0, 5, 5, 0, 3, 0, 4, 0, 4, 0, 6, 0, 5, 0, 6, 0, 6, 0, 5, 0, 8, 7, 0, 5, 0, 6, 0, 8, 0, 6, 0, 10, 0, 7, 0, 10, 0, 9, 0, 10, 0, 8, 0, 12, 11, 0, 7, 0, 10, 0, 12, 0, 12, 0, 10, 0, 15, 0, 11, 0, 14, 0, 15, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,10
|
|
|
COMMENT
|
(Sum over row n) = A000041(n) = number of partitions of n. Reversal of this array is array in A113686, except for row 0.
|
|
FORMULA
|
G.f.=G(t,x)=1/product((1-t^(2j-1)x^(2j-1))(1-x^(2j)), j=1..infinity). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 17 2006
|
|
EXAMPLE
|
First 5 rows:
0
0 1
1 0 1
0 1 0 2
2 0 1 0 2
0 2 0 2 0 3.
The partitions of 5 are
5, 1+4, 2+3, 1+1+3, 1+2+2, 1+1+1+2, 1+1+1+1+1;
sums of odd parts are 5,1,3,5,1,3,5, respectively,
so that the numbers of 0's, 1's, 2s, 3s, 4s, 5s
are 0,2,0,2,0,3, which is row 5 of the array.
|
|
MAPLE
|
g:=1/product((1-t^(2*j-1)*x^(2*j-1))*(1-x^(2*j)), j=1..20): gser:=simplify(series(g, x=0, 22)): P[0]:=1: for n from 1 to 14 do P[n]:=coeff(gser, x^n) od: for n from 0 to 14 do seq(coeff(P[n], t, j), j=0..n) od; # yields sequence in triangular form - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 17 2006
|
|
CROSSREFS
|
Cf. A000041, A113686.
Cf. A066967.
Sequence in context: A116511 A049502 A112170 this_sequence A049825 A039651 A038190
Adjacent sequences: A113682 A113683 A113684 this_sequence A113686 A113687 A113688
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 05 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 17 2006
|
|
|
Search completed in 0.002 seconds
|
