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!)
A161266 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 13 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 10, 9, 10, 10, 12, 11, 12, 12, 14, 13, 14, 14, 16, 16, 17, 17, 19, 19, 20, 20, 22, 22, 23, 23, 25, 25, 27, 26, 29, 28, 31, 29, 33, 31, 35, 32, 37, 34, 39, 37, 42, 39, 45, 42, 49 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,26

LINKS

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

CROSSREFS

Sequence in context: A334948 A161238 A161062 * A161291 A175834 A161318

Adjacent sequences:  A161263 A161264 A161265 * A161267 A161268 A161269

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 18:42 EDT 2022. Contains 353824 sequences. (Running on oeis4.)