login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161098 Number of partitions of n into squares 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, 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, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 7, 8, 8, 9, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 11, 12, 11, 13, 12, 13, 12, 13, 13, 14, 13, 14, 15, 16, 15, 16, 16 (list; graph; refs; listen; history; internal format)
OFFSET

1,40

LINKS

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

CROSSREFS

Sequence in context: A205788 A076398 A086257 * A136177 A066922 A033183

Adjacent sequences:  A161095 A161096 A161097 * A161099 A161100 A161101

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Jun 02 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 13 16:54 EST 2012. Contains 205523 sequences.