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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036861 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, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 0, 1, 0, 0, 12, 0, 4, 0, 2, 29, 0, 12, 0, 8, 63, 2, 31, 0, 26 (list; graph; refs; listen; history; internal format)
OFFSET

1,26

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: A115633 A199571 A036859 * A120324 A136630 A111728

Adjacent sequences:  A036858 A036859 A036860 * A036862 A036863 A036864

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 15 15:20 EST 2012. Contains 205823 sequences.