|
Search: id:A114094
|
|
|
| A114094 |
|
Number of partitions of n into parts that are distinct mod 6. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 4, 5, 5, 8, 8, 10, 13, 14, 15, 21, 22, 24, 32, 31, 35, 46, 49, 49, 66, 60, 70, 91, 95, 90, 121, 106, 126, 168, 167, 153, 204, 175, 210, 294, 273, 245, 323, 274, 330, 492, 422, 374, 487, 411, 495
(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[ #, 6]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
|
|
CROSSREFS
|
Sequence in context: A096443 A126442 A129306 this_sequence A093936 A119353 A140859
Adjacent sequences: A114091 A114092 A114093 this_sequence A114095 A114096 A114097
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
