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

%I #6 Dec 25 2021 02:43:28

%S 1,65,101,142,175,255,316,380,501,625,794,995,1155,1456,1696,2012,

%T 2373,2709,3118,3566,4158,4608,5211,5852,6500,7221,8065,8906,9766,

%U 11089,11855,12868,14020,15337,16601,17854,19255,20840,22364,23964,25813,27665,29650,31635

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

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

%e For n = 2: 65 = 1^2 + 8^2 = 4^2 + 7^2.

%e For n = 3: 101 = 1^2 + 6^2 + 8^2 = 2^2 + 4^2 + 9^2 = 4^2 + 6^2 + 7^2.

%Y Cf. A000290, A025341, A025379, A025415, A025417, A052261, A093195, A097563, A215908, A341040.

%K nonn

%O 1,2

%A _Ilya Gutkovskiy_, Dec 21 2021

%E More terms from _Jinyuan Wang_, Dec 21 2021

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 24 08:48 EDT 2024. Contains 371930 sequences. (Running on oeis4.)