Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036871
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036871 Number of partitions satisfying either one of the two conditions cn(0,5) = cn(1,5) <= cn(2,5) = cn(3,5) = cn(4,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, 1, 0, 0, 0, 0, 3, 1, 0, 0, 1, 6, 5, 0, 0, 3, 11, 15, 0, 1, 9, 20, 36, 0, 3, 20, 39, 75, 1, 9, 44, 79, 146, 3, 23, 87, 162, 272 (list; graph; listen)
OFFSET

1,14

COMMENT

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

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

CROSSREFS

Sequence in context: A098158 A110319 A036872 this_sequence A036876 A065413 A107131

Adjacent sequences: A036868 A036869 A036870 this_sequence A036872 A036873 A036874

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research