Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039900
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039900 Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5). +0
3
1, 1, 2, 4, 6, 9, 13, 19, 27, 38, 52, 71, 95, 127, 167, 220, 285, 370, 474, 607, 770, 976, 1226, 1540, 1920, 2391, 2960, 3660, 4501, 5529, 6760, 8254, 10038, 12190, 14750, 17825, 21470, 25825, 30975, 37101, 44322, 52879, 62937, 74811, 88733 (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 < 0 + 1 + 4 (OMZAAp).

CROSSREFS

Sequence in context: A088575 A026906 A050811 this_sequence A039902 A081659 A081225

Adjacent sequences: A039897 A039898 A039899 this_sequence A039901 A039902 A039903

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