login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of partitions of n into squares where every part appears at least 12 times
1

%I #4 Mar 31 2012 12:35:30

%S 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,

%T 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,

%U 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

%N Number of partitions of n into squares where every part appears at least 12 times

%H R. H. Hardin, <a href="/A161100/b161100.txt">Table of n, a(n) for n=1..1000</a>

%K nonn

%O 1,48

%A _R. H. Hardin_ Jun 02 2009