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!)
A018936 a(n) is the smallest square that is the sum of n distinct positive squares. 7

%I #13 Sep 30 2023 09:20:21

%S 1,25,49,81,100,169,196,289,361,529,529,900,900,1156,1444,1681,2025,

%T 2304,2704,3481,3600,4096,4624,4900,5625,6889,7225,8281,9409,10404,

%U 11236,11881,12996,14400,15129,16900,18769,19600,21316,23104,24964,25921,27889

%N a(n) is the smallest square that is the sum of n distinct positive squares.

%F a(n) = A018935(n)^2. - _Hugo Pfoertner_, Sep 30 2023

%e a(3) = 49 = 36 + 9 + 4 is the smallest square which is the sum of three distinct positive squares.

%Y Cf. A018935, A018937.

%K nonn

%O 1,2

%A _N. J. A. Sloane_

%E Corrected and extended by _David W. Wilson_

%E Name simplified by _Jon E. Schoenfield_, Sep 29 2023

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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)