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

%I #6 Jan 16 2022 01:23:01

%S 0,0,1,1,1,1,1,1,2,1,1,3,2,2,4,3,3,6,4,4,7,6,6,9,7,7,11,9,9,15,11,11,

%T 18,15,15,22,18,18,27,23,22,33,28,28,41,34,34,49,42,42,56,51,51,68,60,

%U 59,79,72,71,94,83,84,111,100,100,127,117,118,147,136,135,171,158,158,199,183,183

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

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

%K nonn

%O 1,9

%A _R. H. Hardin_ Jun 02 2009