login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161107 Number of partitions of n into nonzero triangular numbers where every part appears at least 6 times 1
0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 5, 4, 4, 6, 5, 5, 8, 6, 6, 8, 7, 7, 11, 9, 9, 11, 10, 10, 14, 12, 12, 14, 13, 13, 18, 15, 15, 18, 16, 16, 24, 19, 19, 24, 21, 21, 31, 26, 26, 33, 30, 29, 40, 34, 34, 43, 39, 39, 53, 45, 46, 57, 50, 50, 67, 58, 59, 74, 67, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,18

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A184241 A054390 A161068 * A161042 A029292 A152198

Adjacent sequences:  A161104 A161105 A161106 * A161108 A161109 A161110

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 02 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 01:11 EST 2021. Contains 340262 sequences. (Running on oeis4.)