login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036859 Number of partitions satisfying either one of the two conditions cn(1,5) < cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) or cn(1,5) < cn(3,5) = cn(4,5) <= cn(0,5) = cn(2,5). 0
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 0, 1, 0, 0, 10, 0, 4, 0, 2, 21, 0, 12, 0, 8, 40, 2, 29, 0, 26, 75, 8, 63, 3, 68, 140, 26 (list; graph; refs; listen; history; internal format)
OFFSET

1,19

COMMENTS

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

Short: (1 < 0 = 2 <= 3 = 4) or (1 < 3 = 4 <= 0 = 2).

CROSSREFS

Sequence in context: A115713 A115633 A199571 * A036861 A120324 A136630

Adjacent sequences:  A036856 A036857 A036858 * A036860 A036861 A036862

KEYWORD

nonn,more

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.