Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039848 Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5). +0
1
1, 2, 3, 5, 6, 10, 14, 21, 29, 40, 53, 73, 97, 130, 171, 223, 287, 373, 476, 612, 771, 976, 1224, 1537, 1918, 2384, 2948, 3643, 4476, 5503, 6720, 8203, 9970, 12105, 14649, 17699, 21313, 25632, 30738, 36820, 43981, 52472, 62445, 74225, 88037 (list; graph; listen)
OFFSET

1,2

COMMENT

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

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

CROSSREFS

Sequence in context: A131627 A039840 A039845 this_sequence A018494 A101475 A018524

Adjacent sequences: A039845 A039846 A039847 this_sequence A039849 A039850 A039851

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research