Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036874 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 3, 1, 0, 3, 2, 7, 3, 2, 7, 6, 16, 7, 6, 18, 16, 33, 18, 16, 39, 39, 68, 40, 40, 84, 87, 142, 87, 91, 179 (list; graph; listen)
OFFSET

1,17

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: A036871 A036872 A036873 this_sequence A036875 A036876 A036877

Sequence in context: A035629 A099546 A036870 this_sequence A049403 A104556 A116089

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