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.

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

This page as a plain text file.
%I A350397 #29 Feb 16 2025 08:34:02
%S A350397 305,1980,1900,3321,5256,8310,12516,17108,24832,34249,42381,61697,
%T A350397 78766,106956,132994,170325,203415,266595,322943,393828,475520,569416,
%U A350397 695799,823447,958300,1149125,1313545,1565055,1802736,2088119,2376250,2748270,3135195,3548876
%N A350397 a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal pyramidal numbers in exactly n ways, or -1 if no such number exists.
%H A350397 Martin Ehrenstein, <a href="/A350397/b350397.txt">Table of n, a(n) for n = 3..52</a>
%H A350397 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PyramidalNumber.html">Pyramidal Number</a>
%e A350397 For n = 3: 305 = 1 + 84 + 220 = 20 + 120 + 165 = 56 + 84 + 165.
%Y A350397 Cf. A080851, A350210, A350405.
%K A350397 nonn
%O A350397 3,1
%A A350397 _Ilya Gutkovskiy_, Dec 29 2021
%E A350397 a(10)-a(22) from _Michael S. Branicky_, Dec 29 2021
%E A350397 a(23)-a(36) from _Martin Ehrenstein_, Jan 14 2022