|
%I #4 Mar 31 2012 12:35:30
%S 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,2,1,1,2,1,1,2,1,
%T 1,3,2,2,4,3,3,5,4,4,6,5,5,7,6,6,8,7,7,10,8,8,10,9,9,12,10,10,13,12,
%U 12,15,13,13,16,15,15,18,16,16,19,18,18,21,19,19,23,21,21,25,22,22,27,24,24,31,26,26,33,29,29
%N Number of partitions of n into nonzero triangular numbers where every part appears at least 9 times
%H R. H. Hardin, <a href="/A161110/b161110.txt">Table of n, a(n) for n=1..1000</a>
%K nonn
%O 1,27
%A _R. H. Hardin_ Jun 02 2009
|
