Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039869
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039869 Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5). +0
1
1, 1, 1, 3, 5, 6, 8, 12, 18, 26, 33, 45, 62, 82, 107, 140, 184, 239, 304, 388, 494, 631, 793, 989, 1236, 1544, 1918, 2372, 2915, 3582, 4393, 5372, 6540, 7943, 9624, 11648, 14055, 16916, 20310, 24357, 29143, 34796, 41461, 49336, 58597 (list; graph; listen)
OFFSET

1,4

COMMENT

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

Short: 2 + 3 < 0 + 1 + 4 (BBpMZAAp).

CROSSREFS

Sequence in context: A062832 A089085 A033163 this_sequence A076210 A039014 A102989

Adjacent sequences: A039866 A039867 A039868 this_sequence A039870 A039871 A039872

KEYWORD

nonn

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 November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research