Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036863
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036863 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5) or cn(2,5) = cn(4,5) <= cn(0,5) = cn(1,5) < cn(3,5). +0
1
0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 2, 1, 1, 2, 2, 4, 4, 2, 4, 6, 9, 10, 7, 9, 15, 21, 26, 16, 23, 37, 44, 65, 39, 50, 90, 92, 143, 94, 109, 198, 198, 299, 207, 236 (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 = 4 < 3) or (2 = 4 <= 0 = 1 < 3).

CROSSREFS

Adjacent sequences: A036860 A036861 A036862 this_sequence A036864 A036865 A036866

Sequence in context: A116560 A103784 A045870 this_sequence A083698 A128976 A046772

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research