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!)
A036848 Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(1,5) <= cn(3,5) = cn(4,5). 0
0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 2, 3, 1, 2, 1, 3, 6, 2, 8, 4, 6, 12, 6, 23, 11, 13, 24, 13, 54, 26, 32, 50, 31, 114, 59, 76, 107, 69, 226, 122, 170, 227, 154, 435, 252, 359, 469, 328, 827, 505, 727, 939, 681, 1555, 1000, 1419, 1827, 1364, 2909, 1943, 2701, 3464, 2666, 5379, 3719, 5036, 6430, 5079, 9848, 6984 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

COMMENTS

Also, number of partitions of n such that cn(3,5) = cn(4,5) <= cn(1,5) <= cn(0,5) = cn(2,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..71.

Partitions with restricted parts modulo 5

CROSSREFS

Sequence in context: A036582 A260451 A328749 * A289585 A128864 A106798

Adjacent sequences:  A036845 A036846 A036847 * A036849 A036850 A036851

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 July 16 09:13 EDT 2020. Contains 335784 sequences. (Running on oeis4.)