login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039859 Number of partitions satisfying cn(0,5) = cn(2,5) + cn(3,5). 0
1, 1, 1, 2, 2, 3, 4, 6, 7, 8, 10, 15, 19, 23, 27, 35, 44, 56, 67, 82, 100, 124, 150, 184, 221, 268, 321, 388, 464, 558, 664, 792, 939, 1119, 1326, 1573, 1850, 2181, 2567, 3027, 3547, 4155, 4853, 5681, 6631 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: 0 = 2 + 3 (BBpEZ).

LINKS

Table of n, a(n) for n=1..45.

CROSSREFS

Sequence in context: A011868 A145813 A240865 * A130291 A067835 A029011

Adjacent sequences:  A039856 A039857 A039858 * A039860 A039861 A039862

KEYWORD

nonn

AUTHOR

Olivier Gérard

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 18:19 EDT 2020. Contains 335652 sequences. (Running on oeis4.)