[go: up one dir, main page]

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

%I #7 Jul 07 2024 21:06:34

%S -1,65,62,90,103,136,200,276,376,481,625,806,975,1183,1415,1688,1989,

%T 2325,2698,3110,3563,4059,4600,5188,5825,6513,7254,8050,8903,9815,

%U 10788,11824,12925,14093,15330,16638,18019,19475,21008,22620,24313,26089,27950,29898

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

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%e a(2) = 65 = 1^2 + 8^2 = 4^2 + 7^2.

%e a(3) = 62 = 1^2 + 5^2 + 6^2 = 2^2 + 3^2 + 7^2.

%Y Cf. A000330, A093195, A350241.

%K sign

%O 1,2

%A _Ilya Gutkovskiy_, Jul 02 2024

%E a(12) and beyond from _Michael S. Branicky_, Jul 02 2024