Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039893
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039893 Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5). +0
1
1, 1, 1, 3, 4, 6, 8, 11, 17, 24, 31, 42, 56, 76, 101, 129, 167, 217, 279, 360, 449, 571, 719, 900, 1130, 1394, 1730, 2144, 2630, 3241, 3948, 4827, 5882, 7127, 8642, 10425, 12575, 15141, 18138, 21749, 25974, 31011, 36946, 43877, 52083 (list; graph; listen)
OFFSET

1,4

COMMENT

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: 2 + 3 < 1 + 4 (BBpMAAp).

CROSSREFS

Sequence in context: A079401 A107770 A067054 this_sequence A050115 A037346 A008864

Adjacent sequences: A039890 A039891 A039892 this_sequence A039894 A039895 A039896

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