Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039896
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039896 Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5). +0
1
1, 2, 3, 5, 6, 11, 15, 22, 30, 40, 56, 77, 101, 135, 173, 231, 297, 385, 490, 622, 792, 1002, 1255, 1575, 1951, 2436, 3010, 3718, 4565, 5593, 6842, 8349, 10143, 12310, 14868, 17977, 21637, 26015, 31185, 37316, 44583, 53174, 63261, 75175, 89104 (list; graph; listen)
OFFSET

1,2

COMMENT

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

Short: o < 1 + 4 + 2 + 3 (OMAABBpp).

CROSSREFS

Sequence in context: A039844 A038196 A039849 this_sequence A034407 A068441 A112598

Adjacent sequences: A039893 A039894 A039895 this_sequence A039897 A039898 A039899

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 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research