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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161262 Number of partitions of n into central polygonal numbers A000124 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, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 7, 8, 8, 10, 9, 10, 10, 12, 12, 13, 13, 15, 15, 16, 16, 18, 18, 20, 19, 22, 21, 24, 22, 26, 24, 28, 27, 31, 29, 34, 32, 38, 36, 43, 40, 48, 46, 53, 51, 59, 58, 65, 64, 73, 72, 80, 79, 89, 87, 97, 96, 107, 105 (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: A318471 A161234 A161058 * A161287 A214069 A167969

Adjacent sequences:  A161259 A161260 A161261 * A161263 A161264 A161265

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 06 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 October 22 18:45 EDT 2021. Contains 348175 sequences. (Running on oeis4.)