login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)