|
Search: id:A114097
|
|
|
| A114097 |
|
Number of partitions of n into parts that are distinct mod 10. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 14, 18, 20, 25, 30, 34, 40, 47, 56, 63, 73, 84, 95, 111, 127, 140, 161, 180, 209, 230, 259, 288, 322, 366, 405, 443, 498, 545, 618, 675, 740, 813, 894, 1002, 1084, 1181, 1304, 1410, 1569
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
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[ #, 10]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
|
|
CROSSREFS
|
Sequence in context: A147706 A034141 A055002 this_sequence A083847 A034142 A008675
Adjacent sequences: A114094 A114095 A114096 this_sequence A114098 A114099 A114100
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
