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!)
A359321 a(n) is the smallest n-gonal pyramidal number which can be represented as the sum of n distinct nonzero n-gonal pyramidal numbers in exactly n ways, or -1 if none exists. 0

%I #4 Dec 31 2022 15:25:39

%S 2300,6201,8125,6391

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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PyramidalNumber.html">Pyramidal Number</a>

%e For n = 3: 2300 = 1 + 969 + 1330 = 56 + 220 + 2024 = 165 + 364 + 1771.

%e For n = 4: 6201 = 1 + 91 + 1785 + 4324 = 1 + 285 + 1015 + 4900 = 30 + 140 + 506 + 5525 = 91 + 819 + 1496 + 3795.

%Y Cf. A080851, A350210, A350397, A350423.

%K nonn,more

%O 3,1

%A _Ilya Gutkovskiy_, Dec 25 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 May 17 10:20 EDT 2024. Contains 372594 sequences. (Running on oeis4.)