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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161092 Number of partitions of n into squares where every part appears at least 4 times 1
0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 2, 4, 3, 3, 3, 5, 4, 4, 4, 6, 5, 5, 5, 8, 6, 6, 6, 9, 8, 8, 8, 10, 10, 9, 9, 11, 11, 11, 11, 14, 12, 13, 12, 16, 14, 15, 15, 19, 18, 17, 18, 22, 21, 20, 21, 26, 26, 26, 25, 30, 29, 30, 29, 34, 34, 35, 35, 40, 39, 39, 40, 46, 46, 47, 48, 54 (list; graph; refs; listen; history; internal format)
OFFSET

1,16

LINKS

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

CROSSREFS

Sequence in context: A126805 A110963 A106348 * A029332 A134431 A070879

Adjacent sequences:  A161089 A161090 A161091 * A161093 A161094 A161095

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 17 00:09 EST 2012. Contains 205978 sequences.