|
Search: id:A114095
|
|
|
| A114095 |
|
Number of partitions of n into parts that are distinct mod 7. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 4, 5, 6, 7, 10, 10, 13, 16, 18, 21, 24, 31, 31, 38, 44, 49, 56, 62, 76, 76, 90, 100, 113, 126, 136, 161, 161, 186, 201, 234, 252, 267, 308, 308, 349, 370, 449, 462, 483, 546, 546, 609, 637, 813, 792
(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[ #, 7]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
|
|
CROSSREFS
|
Sequence in context: A086740 A120161 A100665 this_sequence A066639 A025209 A125573
Adjacent sequences: A114092 A114093 A114094 this_sequence A114096 A114097 A114098
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
