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

%I #41 Aug 28 2023 08:20:58

%S 96,192,330,504,840,1304,1872,2910,3971,5340,6851,8932,11700,14496,

%T 18258,22410,27265,32620,39606,47124,55545,65448,76050,87854,101925,

%U 116956,134125,152340,173538,195424,220473,246942,276570,306756,340918,377644,418821,462720

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

%C If a(n) exists, then n divides a(n). - _Thomas Scheuerle_, Apr 13 2022

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

%F a(n) >= n*binomial(n + 2, 3) + n, if a(n) exists. - _Thomas Scheuerle_, Apr 13 2022

%e For n = 3: 96 = 1 + 10 + 85 = 1 + 31 + 64 = 19 + 31 + 46.

%Y Cf. A101321, A350209, A350397, A350405.

%K nonn

%O 3,1

%A _Ilya Gutkovskiy_, Apr 13 2022

%E a(10)-a(16) from _Thomas Scheuerle_, Apr 13 2022

%E a(17)-a(40) from _Michael S. Branicky_, May 19 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 April 16 11:08 EDT 2024. Contains 371711 sequences. (Running on oeis4.)