|
Search: id:A130780
|
|
|
| A130780 |
|
Number of partitions of n such that number of odd parts is greater than or equal to number of even parts. |
|
+0
1
|
|
| 1, 1, 3, 3, 6, 8, 12, 16, 23, 32, 42, 58, 75, 102, 131, 173, 220, 288, 363, 466, 587, 743, 929, 1164, 1448, 1797, 2224, 2738, 3368, 4122, 5042, 6133, 7466, 9035, 10941, 13184, 15888, 19064, 22876, 27343
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
G.f.: Sum_{k>=0} x^k/Product_{i=1..k} (1-x^(2*i))^2.
|
|
EXAMPLE
|
a(5)=6 because we have 5,41,32,311,211, and 11111 (221 does not qualify).
|
|
MAPLE
|
g:=sum(x^k/(product((1-x^(2*i))^2, i=1..k)), k=0..50): gser:=series(g, x=0, 50): seq(coeff(gser, x, n), n=1..40); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 24 2007
|
|
CROSSREFS
|
Cf. A045931, A108949, A108950.
Sequence in context: A114999 A021752 A049626 this_sequence A097307 A026804 A104715
Adjacent sequences: A130777 A130778 A130779 this_sequence A130781 A130782 A130783
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 19 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 24 2007
|
|
|
Search completed in 0.002 seconds
|
