Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036853
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036853 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(1,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, 1, 0, 0, 0, 0, 2, 0, 1, 0, 0, 3, 0, 2, 0, 1, 5, 0, 5, 0, 2, 10, 1, 9, 0, 5, 23, 2, 19, 1, 11, 53, 5, 37, 2, 23, 117, 11, 78, 5 (list; graph; listen)
OFFSET

1,12

COMMENT

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

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

CROSSREFS

Sequence in context: A143251 A115235 A160973 this_sequence A036852 A050327 A075120

Adjacent sequences: A036850 A036851 A036852 this_sequence A036854 A036855 A036856

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 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research