Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039897
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039897 Number of partitions satisfying 0 < cn(2,5) + cn(3,5). +0
1
0, 1, 2, 3, 4, 7, 11, 17, 23, 32, 44, 63, 85, 114, 149, 198, 260, 341, 436, 559, 712, 910, 1149, 1446, 1803, 2254, 2803, 3478, 4282, 5267, 6453, 7905, 9635, 11716, 14191, 17180, 20735, 24985, 29998, 35965, 43019, 51404, 61257, 72880, 86510 (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: o < 2 + 3 (OMBBp).

CROSSREFS

Sequence in context: A025048 A017987 A165407 this_sequence A050193 A072164 A060987

Adjacent sequences: A039894 A039895 A039896 this_sequence A039898 A039899 A039900

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research