Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jul 06 2024 13:18:55
%S 0,25,325,1105,4225,5525,27625,27625,71825,138125,160225,160225,
%T 801125,801125,801125,801125,2082925,2082925,4005625,4005625,5928325,
%U 5928325,5928325,5928325,29641625,29641625,29641625,29641625,29641625,29641625,29641625,29641625
%N Smallest number that is the sum of 2 squares in at least n ways.
%H Ray Chandler, <a href="/A000448/b000448.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F a(n) = min { A000446(k) ; k >= n }. - _M. F. Hasler_, Jul 06 2024
%Y Cf. A000446 (smallest number that is the sum of 2 squares in exactly n ways).
%K nonn
%O 1,2
%A _N. J. A. Sloane_
%E Extended by _Ray Chandler_, Jan 13 2012