A161113 - OEIS

A161113

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

%I #8 Oct 02 2025 23:03:25

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

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

%U 10,9,9,12,10,10,12,11,11,14,12,12,14,13,13,17,15,15,17,16,16,20,18,18,20,19,19,23,21,21,23,22,22,26

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

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

%K nonn

%O 1,36

%A _R. H. Hardin_, Jun 02 2009