Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039866 Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5). +0
1
0, 1, 2, 2, 3, 6, 7, 11, 15, 19, 28, 38, 47, 67, 84, 112, 144, 186, 237, 303, 384, 485, 606, 766, 948, 1181, 1463, 1804, 2215, 2731, 3321, 4066, 4940, 5991, 7263, 8766, 10554, 12711, 15227, 18264, 21799, 26028, 30980, 36826, 43711 (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 + 4 <= 0 + 2 + 3 (AApZBBp).

CROSSREFS

Sequence in context: A011961 A091770 A032058 this_sequence A106369 A032062 A011141

Adjacent sequences: A039863 A039864 A039865 this_sequence A039867 A039868 A039869

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research