login
This site is supported by donations 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; internal format)
OFFSET

1,26

LINKS

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

CROSSREFS

Sequence in context: A095999 A161238 A161062 * A161291 A175834 A161318

Adjacent sequences:  A161263 A161264 A161265 * A161267 A161268 A161269

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Jun 06 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 07:41 EST 2012. Contains 205998 sequences.