Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039847
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039847 Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5). +0
1
0, 1, 2, 3, 5, 8, 11, 16, 23, 34, 45, 61, 81, 110, 147, 192, 249, 324, 415, 536, 678, 864, 1087, 1365, 1708, 2128, 2646, 3277, 4030, 4966, 6072, 7439, 9061, 11010, 13353, 16144, 19492, 23479, 28184, 33823, 40428, 48323, 57582, 68504, 81389 (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: 0 < 1 + 2 + 3 and 0 < 4 + 2 + 3 (MBBpAA).

CROSSREFS

Sequence in context: A006336 A070228 A006304 this_sequence A046938 A060677 A131787

Adjacent sequences: A039844 A039845 A039846 this_sequence A039848 A039849 A039850

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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research