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!)
A036858 Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) < cn(1,5). 0
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 4, 4, 4, 5, 5, 12, 12, 12, 15, 15, 29, 31, 31, 40, 40, 67, 73, 74, 95, 96, 148, 164, 167, 215, 219, 321, 358, 366, 465, 478, 680, 760, 777, 977, 1012, 1411, 1575, 1612, 1999, 2082, 2857, 3188, 3264, 4005, 4187, 5659, 6307, 6465, 7853, 8233, 10968, 12215, 12535, 15107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,14

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..67.

Partitions with restricted parts modulo 5

CROSSREFS

Sequence in context: A134992 A073260 A036854 * A131957 A127932 A006075

Adjacent sequences:  A036855 A036856 A036857 * A036859 A036860 A036861

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 September 23 14:29 EDT 2020. Contains 337310 sequences. (Running on oeis4.)