This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A087058 #4 Jan 22 2015 18:23:58
%S A087058 4,9,25,36,64,81,100,144,169,225,256,289,361,400,484,529,625,676,729,
%T A087058 841,900,1024,1089,1156,1296,1369,1521,1600,1764,1849,1936,2116,2209,
%U A087058 2401,2500,2601,2809,2916,3136,3249,3364,3600,3721,3969,4096,4356,4489
%N A087058 Smallest square number greater than 2*n^2.
%F A087058 A087058(n) = A087057(n)^2 = (1 + A001951(n))^2 = (1 + floor[n*sqrt(2)])^2
%e A087058 A087058(10) = 225 because 225 is the smallest square number greater than 2*10^2 = 200.
%t A087058 Table[Ceiling[Sqrt[2n^2]]^2,{n,50}] (* _Harvey P. Dale_, Jan 22 2015 *)
%Y A087058 Cf. A001951, A087055, A087056, A087057, A087059, A087060.
%K A087058 easy,nonn
%O A087058 1,1
%A A087058 _Jens Voß_, Aug 07 2003