Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039899
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039899 Number of partitions satisfying 0 < cn(0,5) + cn(2,5) + cn(3,5). +0
2
0, 1, 2, 3, 5, 8, 12, 18, 25, 36, 49, 68, 91, 123, 162, 214, 278, 362, 464, 596, 757, 961, 1209, 1521, 1897, 2366, 2931, 3627, 4463, 5487, 6711, 8200, 9976, 12121, 14672, 17738, 21371, 25716, 30852, 36964, 44168, 52709, 62746, 74600, 88497 (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 + 2 + 3 (OMZBBp).

CROSSREFS

Sequence in context: A111388 A127884 A105858 this_sequence A039901 A121946 A058984

Adjacent sequences: A039896 A039897 A039898 this_sequence A039900 A039901 A039902

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research