Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039849
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039849 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, 11, 15, 22, 30, 40, 55, 76, 100, 134, 173, 228, 293, 381, 485, 620, 783, 991, 1242, 1560, 1941, 2413, 2982, 3685, 4525, 5560, 6785, 8281, 10062, 12214, 14776, 17845, 21480, 25830, 30967, 37091, 44286, 52827, 62853, 74699, 88590 (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 (ZAABBpp).

CROSSREFS

Sequence in context: A039839 A039844 A038196 this_sequence A039896 A034407 A068441

Adjacent sequences: A039846 A039847 A039848 this_sequence A039850 A039851 A039852

KEYWORD

nonn

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research