|
Search: id:A131942
|
|
|
| A131942 |
|
Number of partitions of n in which each odd part has odd multiplicity. |
|
+0
8
|
|
| 1, 1, 1, 3, 3, 6, 6, 11, 13, 21, 24, 35, 44, 59, 74, 99, 126, 158, 202, 250, 320, 392, 495, 598, 758, 908, 1134, 1358, 1685, 2003, 2466, 2925, 3576, 4234, 5129, 6064, 7308, 8612, 10305, 12135, 14443, 16963, 20085, 23548, 27754, 32482, 38105, 44503, 52042
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
Brian Drake, Table of n, a(n) for n = 0..100
|
|
FORMULA
|
G.f.: product_{n=1..inf} (1+q^(2n-1)-q^(4n-2))/((1-q^(2n))(1-q^(4n-2)))
|
|
EXAMPLE
|
a(5)=6 because 5, 4+1, 3+2, 2+2+1, 2+1+1+1, and 1+1+1+1+1 have all odd parts with odd multiplicity. The partition 3+1+1 is the partition of 5 which is not counted.
|
|
MAPLE
|
A:= series(product( 1/(1-q^(2*n)) *(1+q^(2*n-1)-q^(4*n-2))/(1-q^(4*n-2)), n=1..15), q, 25): seq(coeff(A, q, i), i=0..24);
|
|
CROSSREFS
|
Cf. A000041, A015128, A006950, A046682.
Adjacent sequences: A131939 A131940 A131941 this_sequence A131943 A131944 A131945
Sequence in context: A008805 A026925 A088528 this_sequence A117775 A021301 A016652
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Brian Drake (bdrake(AT)brandeis.edu), Jul 30 2007
|
|
|
Search completed in 0.002 seconds
|
