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!)
A161100 Number of partitions of n into squares where every part appears at least 12 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 2, 4, 3, 3, 3, 5, 4, 4, 4, 6, 5, 5, 5, 7, 6, 6, 6, 8, 7, 7, 7, 9, 8, 8, 8, 10, 9, 9, 9, 11, 10, 10, 10, 12, 11, 11, 11, 13, 12, 12, 12, 14, 13, 13, 13, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,48

LINKS

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

CROSSREFS

Sequence in context: A161101 A115362 A277872 * A053543 A161099 A118663

Adjacent sequences:  A161097 A161098 A161099 * A161101 A161102 A161103

KEYWORD

nonn

AUTHOR

R. H. Hardin Jun 02 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 February 19 04:04 EST 2020. Contains 332034 sequences. (Running on oeis4.)