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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161110 Number of partitions of n into nonzero triangular numbers where every part appears at least 9 times 1
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, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 5, 4, 4, 6, 5, 5, 7, 6, 6, 8, 7, 7, 10, 8, 8, 10, 9, 9, 12, 10, 10, 13, 12, 12, 15, 13, 13, 16, 15, 15, 18, 16, 16, 19, 18, 18, 21, 19, 19, 23, 21, 21, 25, 22, 22, 27, 24, 24, 31, 26, 26, 33, 29, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,27

LINKS

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

CROSSREFS

Sequence in context: A214018 A304869 A161071 * A161045 A029322 A152828

Adjacent sequences:  A161107 A161108 A161109 * A161111 A161112 A161113

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 14 03:52 EST 2018. Contains 317159 sequences. (Running on oeis4.)