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!)
A161263 Number of partitions of n into central polygonal numbers A000124 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, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 9, 7, 9, 8, 11, 9, 11, 10, 13, 11, 14, 13, 16, 14, 17, 16, 19, 17, 20, 19, 23, 20, 24, 22, 27, 23, 28, 25, 31, 26, 34, 29, 37, 31, 40, 35, 45, 39, 49, 43, 56, 48, 61, 54, 69, 59, 74, 67, 83, 73, 91, 82 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,20

LINKS

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

CROSSREFS

Sequence in context: A025826 A161235 A161059 * A161288 A185217 A131456

Adjacent sequences:  A161260 A161261 A161262 * A161264 A161265 A161266

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 28 20:24 EST 2022. Contains 350659 sequences. (Running on oeis4.)