Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036866 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(1,5) = cn(3,5) <= cn(2,5) = cn(4,5) or cn(2,5) = cn(3,5) = cn(4,5) <= cn(0,5) = cn(1,5). +0
1
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 0, 1, 3, 2, 1, 0, 5, 5, 5, 2, 1, 15, 10, 9, 5, 2, 37, 23, 19, 11, 5, 77, 54, 37, 23, 11, 151, 118, 79, 47, 25, 282 (list; graph; listen)
OFFSET

1,11

COMMENT

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

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

CROSSREFS

Sequence in context: A071676 A115363 A036867 this_sequence A159854 A144225 A017837

Adjacent sequences: A036863 A036864 A036865 this_sequence A036867 A036868 A036869

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research