A161101 Number of partitions of n into squares where every part appears at least 13 times

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, 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, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13

Offset

1,52

Links

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

Crossrefs

Sequence in context: A307706 A161102 A276329 * A115362 A365632 A340853

Adjacent sequences: A161098 A161099 A161100 * A161102 A161103 A161104

Keyword

nonn

Author

R. H. Hardin Jun 02 2009

Status

approved