Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036859
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,19

COMMENT

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: A128131 A115713 A115633 this_sequence A036861 A120324 A136630

Adjacent sequences: A036856 A036857 A036858 this_sequence A036860 A036861 A036862

KEYWORD

nonn,more

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research