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.

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

This page as a plain text file.
%I A350288 #9 Dec 27 2021 02:44:16
%S A350288 1,16,37,64,83,128,177,204,270,352,430,533,632,764,893,1102,1256,1443,
%T A350288 1630,1855,2141,2384,2699,3053,3378,3753,4176,4620,5068,5570,6107,
%U A350288 6654,7253,7904,8526,9241,9975,10699,11533,12401,13301,14189,15179,16233,17286,18412
%N A350288 a(n) is the smallest number which can be represented as the sum of n distinct nonzero triangular numbers in exactly n ways, or 0 if no such number exists.
%e A350288 For n = 2: 16 = 1 + 15 = 6 + 10.
%e A350288 For n = 3: 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21.
%Y A350288 Cf. A000217, A265134, A307597, A307598, A341021-A341027, A342326, A350241.
%K A350288 nonn
%O A350288 1,2
%A A350288 _Ilya Gutkovskiy_, Dec 23 2021
%E A350288 More terms from _Jinyuan Wang_, Dec 26 2021