Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jan 09 2022 08:28:24
%S 140,490,1055,1872,2610,4255,5011,8708,7497,10819,12860,15636,18055,
%T 24275,27373,28146,30826,38178,41849,44025,36165,47621,57896,64648,
%U 60064,67125,71975,81820,77701,91584,91320,99835,98916,108686,112606,123180,120919,142270
%N a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists.
%H Martin Ehrenstein, <a href="/A350210/b350210.txt">Table of n, a(n) for n = 3..1002</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PyramidalNumber.html">Pyramidal Number</a>
%e For n = 3: 140 = 1 + 20 + 35 + 84 = 56 + 84 = 20 + 120. - _Martin Ehrenstein_, Jan 09 2022
%Y Cf. A080851, A350205, A350206, A350207, A350209, A350397.
%K nonn
%O 3,1
%A _Ilya Gutkovskiy_, Dec 19 2021
%E a(35)-a(40) from _Martin Ehrenstein_, Jan 09 2022