Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039878
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039878 Number of partitions satisfying cn(0,5) + cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5). +0
1
0, 1, 2, 2, 2, 5, 7, 10, 12, 16, 23, 32, 39, 53, 69, 91, 113, 146, 186, 239, 298, 371, 462, 586, 722, 892, 1092, 1346, 1650, 2022, 2449, 2977, 3603, 4367, 5259, 6329, 7582, 9099, 10875, 12981, 15440, 18378, 21800, 25839, 30537 (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 + 4 <= 2 + 3 (ZAApBBp).

CROSSREFS

Sequence in context: A097006 A033306 A136347 this_sequence A039886 A109523 A008295

Adjacent sequences: A039875 A039876 A039877 this_sequence A039879 A039880 A039881

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 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research