login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A114094
Number of partitions of n into parts that are distinct mod 6.
2
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
OFFSET
1,3
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 1..1000
EXAMPLE
a(7)=5 because there are 5 such partitions 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: A126442 A129306 A322077 * A179255 A332285 A324325
KEYWORD
nonn
AUTHOR
Giovanni Resta, Feb 06 2006
STATUS
approved