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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036847 Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) < cn(1,5). 0
1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 5, 5, 8, 8, 10, 12, 13, 20, 20, 26, 31, 32, 47, 49, 66, 77, 79, 107, 114, 157, 182, 186, 240, 257, 353, 409, 418, 523, 562, 758, 878, 901, 1109, 1192, 1570, 1816, 1875, 2285, 2455, 3162, 3648, 3781, 4582, 4925, 6215, 7151, 7438, 8963, 9638, 11967, 13724, 14311, 17156 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

Also, number of partitions of n such that cn(3,5) = cn(4,5) <= cn(0,5) = cn(2,5) < cn(1,5).

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

LINKS

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

Partitions with restricted parts modulo 5

CROSSREFS

Sequence in context: A087897 A029056 A226503 * A282379 A029055 A035397

Adjacent sequences:  A036844 A036845 A036846 * A036848 A036849 A036850

KEYWORD

nonn

AUTHOR

Olivier Gérard

EXTENSIONS

Edited and extended by Max Alekseyev, Dec 01 2013

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 January 19 06:37 EST 2020. Contains 331033 sequences. (Running on oeis4.)