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 #4 Aug 23 2012 15:19:50
%S 0,2,3,4,8,9,10,11,12,18,19,20,21,22,23,24,32,33,34,35,36,37,38,39,40,
%T 50,51,52,53,54,55,56,57,58,59,60,72,73,74,75,76,77,78,79,80,81,82,83,
%U 84,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,128,129
%N n + largest square less than or equal to n; numbers in the range [2k^2,2k^2+2k] for some k.
%F a(n) = n+[sqrt(n)]^2 = n+A048760(n) = 2n-A053186(n).
%e a(15)=15+9=24; a(16)=16+16=32; a(17)=17+16=33.
%t Table[n+Floor[Sqrt[n]]^2,{n,0,70}] (* _Harvey P. Dale_, Aug 23 2012 *)
%Y Cf. A060984, A061885.
%K nonn
%O 0,2
%A _Henry Bottomley_, May 12 2001