A161115 - OEIS

A161115

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

%I #9 Dec 29 2023 23:07:36

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

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

%U 7,6,7,8,7,8,9,8,9,10,9,10,11,10,11,13,11,12,13,12,13,15,13,14,15,14,15,17,15,17,18,17,18,20,18,20,21,20

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

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

%K nonn

%O 1,42

%A _R. H. Hardin_, Jun 02 2009