cp's OEIS Frontend

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.

A374806 a(n) is the smallest number which can be represented as the sum of 3 distinct nonzero triangular numbers in exactly n ways, or -1 if no such number exists.

This page as a plain text file.
%I A374806 #6 Feb 16 2025 08:34:07
%S A374806 10,19,37,52,82,109,136,241,226,217,247,364,427,457,541,532,577,637,
%T A374806 961,721,787,1066,1102,1381,1267,1564,1192,1396,1816,1501,1612,1927,
%U A374806 1942,2242,1792,2842,2587,2557,2422,2866,2887,3181,3271,3412,4126
%N A374806 a(n) is the smallest number which can be represented as the sum of 3 distinct nonzero triangular numbers in exactly n ways, or -1 if no such number exists.
%H A374806 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TriangularNumber.html">Triangular Number</a>
%e A374806 a(3) = 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21.
%Y A374806 Cf. A000217, A025415, A342326, A374807.
%K A374806 nonn
%O A374806 1,1
%A A374806 _Ilya Gutkovskiy_, Jul 20 2024