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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161096 Number of partitions of n into squares where every part appears at least 8 times 1
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, 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, 12, 10, 10, 10, 12, 11, 11, 11, 14, 14, 13, 13, 15, 14, 14, 14, 16, 16, 17, 16, 18, 17, 17, 17, 19, 18, 19, 20 (list; graph; refs; listen; history; internal format)
OFFSET

1,32

LINKS

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

CROSSREFS

Sequence in context: A105240 A143654 A170981 * A165983 A083894 A128257

Adjacent sequences:  A161093 A161094 A161095 * A161097 A161098 A161099

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 16 11:25 EST 2012. Contains 205907 sequences.