login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039853 Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1. 0
1, 2, 3, 4, 5, 7, 9, 12, 15, 18, 23, 29, 35, 43, 51, 62, 74, 89, 105, 124, 146, 172, 201, 235, 272, 316, 366, 423, 486, 559, 640, 734, 838, 955, 1086, 1235, 1400, 1587, 1793, 2025, 2282, 2572, 2891, 3248, 3642 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

Short: 0 + 2 + 3 <= u (ZBBpU).

CROSSREFS

Sequence in context: A033100 A030741 A190269 * A062188 A122129 A003413

Adjacent sequences:  A039850 A039851 A039852 * A039854 A039855 A039856

KEYWORD

nonn

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.