Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036851
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036851 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(2,5) <= cn(1,5) < cn(3,5) = cn(4,5) or cn(3,5) = cn(4,5) <= cn(1,5) < cn(0,5) = cn(2,5). +0
1
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 1, 1, 0, 3, 0, 2, 3, 1, 6, 1, 5, 8, 2, 13, 4, 10, 18, 6, 31, 11, 22, 39, 15, 73, 28, 46, 79, 35, 161, 65, 101, 161 (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 = 2 <= 1 < 3 = 4) or (3 = 4 <= 1 < 0 = 2).

CROSSREFS

Sequence in context: A099544 A036414 A049310 this_sequence A036850 A113206 A158800

Adjacent sequences: A036848 A036849 A036850 this_sequence A036852 A036853 A036854

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research