Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039904
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039904 Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5). +0
1
1, 1, 2, 4, 7, 9, 14, 20, 28, 41, 54, 74, 99, 131, 174, 226, 294, 380, 485, 623, 785, 996, 1249, 1565, 1952, 2425, 3001, 3707, 4553, 5592, 6828, 8334, 10128, 12291, 14866, 17954, 21617, 25991, 31159, 37311, 44554, 53141, 63229, 75137, 89096 (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 + 2 and o < 0 + 1 + 4 + 3 (OMZBBAAp).

CROSSREFS

Sequence in context: A090893 A100486 A139533 this_sequence A115162 A097433 A110078

Adjacent sequences: A039901 A039902 A039903 this_sequence A039905 A039906 A039907

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