Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036867
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036867 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(4,5) <= cn(3,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, 3, 6, 5, 2, 2, 8, 13, 10, 5, 5, 19, 31, 22, 13, 14, 40, 74, 45, 29, 35, 82, 162, 100, 64, 81, 168 (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 = 4 <= 3 < 0 = 1).

CROSSREFS

Sequence in context: A076833 A071676 A115363 this_sequence A036866 A017837 A127840

Adjacent sequences: A036864 A036865 A036866 this_sequence A036868 A036869 A036870

KEYWORD

nonn,more

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 25 02:12 EDT 2008. Contains 142294 sequences.


AT&T Labs Research