|
| |
|
|
A108949
|
|
Number of partitions of n with more even parts than odd parts.
|
|
6
| |
|
|
0, 1, 0, 2, 1, 3, 3, 6, 7, 10, 14, 19, 26, 33, 45, 58, 77, 97, 127, 161, 205, 259, 326, 411, 510, 639, 786, 980, 1197, 1482, 1800, 2216, 2677, 3275, 3942, 4793, 5749, 6951, 8309, 9995, 11912, 14259
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| a(n) = A171966(n) - A045931(n) = A171967(n) - A108950(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 21 2010]
|
|
|
EXAMPLE
| a(6)=3:{[6],[4,2],[2,2,2]};a(7)=3:{[4,2,1],[3,2,2],[2,2,2,1]}
|
|
|
MAPLE
| with(combinat, partition):evnbigrodd:=proc(n::nonnegint) local evencount, oddcount, bigcount, parts, i, j; printlevel:=-1; bigcount:=0; partitions:=partition(n); for i from 1 to nops(partitions) do evencount:=0; oddcount:=0; for j from 1 to nops(partitions[i]) do if (op(j, partitions[i]) mod 2 <>0) then oddcount:=oddcount+1 fi; if (op(j, partitions[i]) mod 2 =0) then evencount:=evencount+1 fi od; if (evencount>oddcount) then bigcount:=bigcount+1 fi od; printlevel:=1; return(bigcount) end proc; seq(evnbigrodd(i), i=1..42);
|
|
|
CROSSREFS
| Cf. A045931 for #even parts = #odd parts, A108950 for #even parts < #odd parts.
Cf. A171966, A130780. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 21 2010]
Sequence in context: A124774 A056610 A096373 * A167704 A052959 A109522
Adjacent sequences: A108946 A108947 A108948 * A108950 A108951 A108952
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Len Smiley ( smiley (AT) math.uaa.alaska.edu), Jul 21 2005
|
| |
|
|
