Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039901
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039901 Number of partitions satisfying 0 < cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(4,5) + cn(2,5) + cn(3,5). +0
1
0, 1, 2, 3, 5, 8, 12, 18, 25, 37, 49, 68, 91, 123, 165, 215, 278, 362, 465, 603, 760, 962, 1209, 1524, 1911, 2374, 2934, 3629, 4471, 5514, 6728, 8208, 9982, 12139, 14720, 17772, 21390, 25732, 30889, 37049, 44231, 52749, 62782, 74671, 88640 (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 < 1 + 2 + 3 and o < 4 + 2 + 3 (OMAABBp).

CROSSREFS

Sequence in context: A127884 A105858 A039899 this_sequence A121946 A058984 A084376

Adjacent sequences: A039898 A039899 A039900 this_sequence A039902 A039903 A039904

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 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research