Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036847
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036847 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
1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 5, 5, 8, 8, 10, 12, 13, 20, 20, 26, 31, 32, 47, 49, 66, 77, 79, 107, 114, 157, 182, 186, 240, 257, 353, 409, 418, 523, 562, 758, 878, 901, 1109, 1192 (list; graph; listen)
OFFSET

1,6

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

Adjacent sequences: A036844 A036845 A036846 this_sequence A036848 A036849 A036850

Sequence in context: A029057 A087897 A029056 this_sequence A029055 A035397 A033295

KEYWORD

nonn

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