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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161111 Number of partitions of n into nonzero triangular numbers where every part appears at least 10 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 10, 9, 9, 10, 10, 10, 12, 11, 11, 12, 13, 13, 15, 14, 14, 15, 16, 16, 18, 17, 17, 18, 19, 19, 21, 20, 20, 21, 22, 22, 25, 23, 23, 25, 25, 25, 29, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,30

LINKS

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

CROSSREFS

Sequence in context: A161112 A161047 A161072 * A161046 A230404 A082647

Adjacent sequences:  A161108 A161109 A161110 * A161112 A161113 A161114

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 19:19 EST 2018. Contains 317116 sequences. (Running on oeis4.)