login
Number of partitions of n into nonzero triangular numbers where every part appears at least 2 times
1

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

%S 0,1,1,1,1,2,1,2,3,2,3,5,3,5,6,5,6,9,6,10,11,10,12,16,12,17,19,17,21,

%T 27,21,30,32,30,35,42,35,46,50,47,55,66,56,72,77,73,84,97,86,107,114,

%U 110,125,143,128,156,165,160,181,204,186,224,236,230,259,285,266,312,329,322

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

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

%K nonn

%O 1,6

%A _R. H. Hardin_ Jun 02 2009