login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161261 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 8 times 1
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 8, 6, 8, 7, 10, 8, 10, 9, 13, 11, 13, 12, 16, 14, 16, 15, 20, 17, 20, 18, 24, 20, 24, 21, 30, 24, 30, 26, 36, 30, 38, 34, 46, 39, 49, 43, 57, 49, 62, 55, 72, 62, 77, 68, 87, 77, 94, 85, 106, 95, 114, 104, 128, 116, 138 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,16

LINKS

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

CROSSREFS

Sequence in context: A025821 A161233 A161057 * A161286 A185216 A247976

Adjacent sequences:  A161258 A161259 A161260 * A161262 A161263 A161264

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 January 17 11:22 EST 2022. Contains 350393 sequences. (Running on oeis4.)