Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036854 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5) or cn(3,5) = cn(4,5) < cn(0,5) = cn(2,5) <= cn(1,5). +0
1
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 4, 4, 4, 5, 5, 11, 12, 12, 15, 15, 26, 30, 31, 40, 40, 60, 70, 73, 94, 96, 135, 157, 164, 211, 218, 298, 344, 359, 453, 474, 640, 733, 763 (list; graph; listen)
OFFSET

1,13

COMMENT

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

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

CROSSREFS

Sequence in context: A111731 A134992 A073260 this_sequence A036858 A131957 A127932

Adjacent sequences: A036851 A036852 A036853 this_sequence A036855 A036856 A036857

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research