Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036860 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, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 0, 1, 1, 0, 8, 0, 3, 3, 1, 18, 1, 8, 9, 3, 38, 4, 20, 23, 9, 77, 12, 44, 54, 23, 156 (list; graph; listen)
OFFSET

1,20

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: A036855 A147985 A147987 this_sequence A119624 A119612 A101949

Adjacent sequences: A036857 A036858 A036859 this_sequence A036861 A036862 A036863

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


AT&T Labs Research