A161114 - OEIS

A161114

Number of partitions of n into nonzero triangular numbers where every part appears at least 13 times

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

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

%T 1,1,1,1,2,1,1,2,1,1,2,1,1,2,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,

%U 8,8,8,9,9,9,10,10,10,12,11,11,12,12,12,14,13,13,14,14,14,16,16,16,17,17,17,19,19,19,20,20,20,22,22,22

%N Number of partitions of n into nonzero triangular numbers where every part appears at least 13 times

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

%K nonn

%O 1,39

%A _R. H. Hardin_ Jun 02 2009