Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039870
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039870 Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5). +0
1
0, 1, 2, 2, 3, 6, 8, 12, 15, 21, 29, 42, 53, 71, 93, 123, 159, 207, 262, 340, 427, 544, 681, 861, 1074, 1335, 1655, 2049, 2521, 3118, 3794, 4648, 5655, 6884, 8358, 10095, 12170, 14669, 17617, 21174, 25274, 30223, 36009, 42877, 50975 (list; graph; listen)
OFFSET

1,3

COMMENT

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

Short: 1 <= 0 + 2 + 3 and 4 <= 0 + 2 + 3 (AAZBBp).

CROSSREFS

Sequence in context: A007801 A077871 A035587 this_sequence A100948 A035571 A079069

Adjacent sequences: A039867 A039868 A039869 this_sequence A039871 A039872 A039873

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research