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!)
A114093 Number of partitions of n into parts that are distinct mod 5. 2
1, 1, 2, 2, 3, 4, 4, 6, 6, 8, 10, 10, 13, 13, 18, 20, 20, 24, 24, 36, 35, 35, 40, 40, 66, 56, 56, 62, 62, 113, 84, 84, 91, 91, 183, 120, 120, 128, 128, 283, 165, 165, 174, 174, 421, 220, 220, 230, 230, 606 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Fausto A. C. Cariboni, Table of n, a(n) for n = 1..2000
EXAMPLE
a(5)=3 because there are 3 such partition of 5: {5}, {2,3}, {1,4}.
MATHEMATICA
<< DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #, 5]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
CROSSREFS
Sequence in context: A348526 A138374 A029936 * A345141 A239950 A077768
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 26 21:53 EDT 2024. Contains 372004 sequences. (Running on oeis4.)