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 A258258 #28 Jan 01 2020 15:19:39 %S A258258 1,16,40,75,52,82,166,178,147,217,334,247,481,634,457,516,921,646, %T A258258 1047,1132,822,787,2110,1351,1537,1542,1402,1192,1666,1696,2137,1759, %U A258258 1876,2271,1792,2712,2587,3216,3909,2782,3007,2956,4242,3397,3682,4039,3607,3601 %N A258258 Least number k having exactly n representations as a sum of the minimal number of triangular numbers, A000217. %C A258258 Fermat's polygonal number theorem states that every positive integer is a sum of at most n n-gonal numbers. The triangular case was proved in 1796 by Gauss (Eureka theorem), stating that every positive integer is the sum of at most three triangular numbers. This sequence is based on this representation as a sum of the minimal number of triangular numbers. %e A258258 a(2) = 16 = 1 + 15 = 6 + 10 is the smallest number with two representations. %e A258258 a(3) = 40 = 1 + 3 + 36 = 6 + 6 + 28 = 10 + 15 + 15 is the smallest number with three representations. %e A258258 a(4) = 75 = 3 + 6 + 66 = 3 + 36 + 36 = 10 + 10 + 55 = 15 + 15 + 45 is the smallest number with four representations. %Y A258258 Cf. A141490, A258257. %K A258258 nonn %O A258258 1,2 %A A258258 _Martin Renner_, May 24 2015