Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039894
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039894 Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5). +0
1
0, 1, 2, 2, 3, 5, 7, 11, 13, 18, 25, 35, 45, 59, 75, 102, 130, 168, 211, 267, 343, 431, 536, 675, 828, 1042, 1280, 1574, 1935, 2363, 2894, 3522, 4261, 5183, 6241, 7552, 9062, 10874, 13047, 15589, 18609, 22163, 26315, 31298, 37051 (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 <= 2 + 3 (AApBBp).

CROSSREFS

Adjacent sequences: A039891 A039892 A039893 this_sequence A039895 A039896 A039897

Sequence in context: A001083 A120412 A022864 this_sequence A133225 A066889 A077419

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research