The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350210 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. 5

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 10 08:44 EDT 2024. Contains 373257 sequences. (Running on oeis4.)