Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036872 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, 0, 0, 0, 1, 0, 0, 0, 0, 3, 1, 0, 0, 1, 6, 3, 1, 0, 3, 12, 8, 3, 2, 9, 23, 18, 8, 6, 22, 48, 38, 21, 17, 50, 103, 77, 47, 44, 104, 218, 158 (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 < 3 <= 2 = 4) or (2 = 4 < 3 <= 0 = 1).

CROSSREFS

Sequence in context: A122083 A098158 A110319 this_sequence A036871 A036876 A065413

Adjacent sequences: A036869 A036870 A036871 this_sequence A036873 A036874 A036875

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research