Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039867
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039867 Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5). +0
1
1, 1, 2, 4, 5, 8, 11, 16, 22, 29, 40, 57, 74, 96, 125, 166, 215, 277, 351, 449, 570, 721, 901, 1131, 1409, 1750, 2163, 2671, 3283, 4034, 4923, 6003, 7298, 8862, 10724, 12949, 15582, 18737, 22482, 26931, 32153, 38344, 45639, 54260, 64366 (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: 2 + 3 <= 0 + 1 + 4 (BBpZAAp).

CROSSREFS

Sequence in context: A105659 A060773 A074824 this_sequence A080136 A080033 A007379

Adjacent sequences: A039864 A039865 A039866 this_sequence A039868 A039869 A039870

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research