|
| |
|
|
A114098
|
|
Number of partitions of n into parts that are distinct mod 9.
|
|
1
|
|
|
|
1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 11, 15, 16, 20, 25, 28, 32, 39, 46, 50, 62, 66, 78, 93, 101, 112, 132, 150, 161, 192, 202, 232, 268, 287, 312, 361, 400, 425, 497, 516, 582, 658, 698, 748, 858, 932, 982, 1135, 1164, 1296
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Table of n, a(n) for n=1..50.
|
|
|
EXAMPLE
|
a(7)=5 because there are 5 such partition of 7: {7}, {1,6}, {2,5}, {3,4}, {4,2,1}.
|
|
|
MATHEMATICA
|
<< DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #, 9]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
|
|
|
CROSSREFS
|
Sequence in context: A109950 A008674 A067596 * A147706 A034141 A055002
Adjacent sequences: A114095 A114096 A114097 * A114099 A114100 A114101
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Giovanni Resta, Feb 06 2006
|
|
|
STATUS
|
approved
|
| |
|
|
