This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A258257 #11 Jun 02 2025 11:47:30
%S A258257 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 A258257 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 A258257 1,1,3,2,1,2,4,2,3,1,1,2,3,6,1,1,3,3,1
%N A258257 The number of representations of n as a minimal number of triangular numbers, A000217(n).
%H A258257 Giovanni Resta, <a href="/A258257/b258257.txt">Table of n, a(n) for n = 1..10000</a>
%e A258257 a(5) = 1 since 5 = 1 + 1 + 3 is the only representation as a minimal number of three triangular numbers.
%e A258257 a(16) = 2 since 16 = 1 + 15 = 6 + 10 has two representations as a minimal number of two triangular numbers.
%t A258257 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 A258257 Cf. A061336, A180466.
%K A258257 nonn
%O A258257 1,16
%A A258257 _Martin Renner_, May 24 2015