|
%I #9 Jun 09 2015 12:38:02
%S 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,2,1,1,1,2,1,1,2,1,1,1,1,2,2,2,1,
%T 2,1,1,1,1,3,2,2,1,2,1,2,2,1,1,1,2,5,1,2,1,2,1,1,3,1,1,2,3,1,1,1,1,2,
%U 1,1,3,2,1,2,4,2,3,1,1,2,3,6,1,1,3,3,1
%N The number of representations of n as a minimal number of triangular numbers, A000217(n)
%H Giovanni Resta, <a href="/A258257/b258257.txt">Table of n, a(n) for n = 1..10000</a>
%e a(5) = 1 since 5 = 1 + 1 + 3 is the only representation as a minimal number of three triangular numbers.
%e a(16) = 2 since 16 = 1 + 15 = 6 + 10 has two representations as a minimal number of two triangular numbers.
%t t[n_] := n (n + 1)/2; a[n_] := Block[{k = 1, t, tt = t /@ Range[ Sqrt[2*n]]}, While[{} == (r = IntegerPartitions[n, {k}, tt]), k++]; Length@r]; Array[a, 100] (* _Giovanni Resta_, Jun 09 2015 *)
%Y Cf. A061336, A180466.
%K nonn
%O 1,16
%A _Martin Renner_, May 24 2015
|
