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 A087060 #13 Jul 01 2017 10:52:37
%S A087060 1,1,2,4,1,8,2,7,7,4,14,1,14,8,9,17,2,23,7,16,18,7,31,4,25,17,14,32,1,
%T A087060 36,14,23,31,8,49,9,34,28,17,49,2,47,23,28,46,7,62,16,41,41,18,68,7,
%U A087060 56,34,31,63,4,73,25,46,56,17,89,14,63,47,32,82,1,82,36,49,73,14,103,23,68
%N A087060 Difference between 2n^2 and the nearest square number.
%C A087060 max(a(n)/n) approaches sqrt(2), and the indices of the maxima are apparently in A227792. - _Ralf Stephan_, Sep 23 2013
%H A087060 Alois P. Heinz, <a href="/A087060/b087060.txt">Table of n, a(n) for n = 1..10000</a>
%F A087060 a(n) = min [A087056(n), A087059(n)] = min [2*n^2 - (floor[n*sqrt(2)])^2, (1 + floor[n*sqrt(2)])^2 - 2*n^2]
%e A087060 a(10) = 4 because the difference between 2*10^2 = 200 and the nearest square number (196) is 4.
%t A087060 dnsn[n_]:=Module[{c=2n^2,a,b},a=Floor[Sqrt[c]]^2;b=Ceiling[Sqrt[c]]^2;Min[c-a,b-c]]; Array[dnsn,80] (* _Harvey P. Dale_, Jul 01 2017 *)
%Y A087060 Cf. A001951, A087055, A087056, A087057, A087058, A087059.
%K A087060 easy,nonn,look
%O A087060 1,3
%A A087060 _Jens Voß_, Aug 07 2003