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 A082532 #15 Sep 08 2022 08:45:10
%S A082532 1,2,1,8,7,4,17,14,9,2,23,16,7,34,25,14,1,36,23,8,49,34,17,64,47,28,7,
%T A082532 62,41,18,79,56,31,4,73,46,17,92,63,32,113,82,49,14,103,68,31,126,89,
%U A082532 50,9,112,71,28,137,94,49,2
%N A082532 a(n) = n^2 - 2*floor(n/sqrt(2))^2.
%H A082532 G. C. Greubel, <a href="/A082532/b082532.txt">Table of n, a(n) for n = 1..10000</a>
%F A082532 a(n) = n^2 - 2*(A049472(n))^2. - _R. J. Mathar_, Mar 28 2011
%e A082532 a(3)=1 since 3^2 - 2*floor(3/1.4142..)^2 = 9 - 2*2^2 = 9 - 8 = 1.
%p A082532 A049472 := proc(n) floor(n/sqrt(2)) ; end proc:
%p A082532 A082532 := proc(n) n^2-2*A049472(n)^2 ; end proc:
%p A082532 seq(A082532(n),n=1..80) ; # _R. J. Mathar_, Mar 28 2011
%t A082532 Table[n^2 - 2*Floor[n/Sqrt[2]]^2, {n, 1, 100}] (* _G. C. Greubel_, Jan 27 2018 *)
%o A082532 (PARI) for(n=1,50, print1(n^2 - 2*floor(n/sqrt(2))^2, ", ")) \\ _G. C. Greubel_, Jan 27 2018
%o A082532 (Magma) [n^2 - 2*Floor(n/Sqrt(2))^2: n in [1..50]]; // _G. C. Greubel_, Jan 27 2018
%Y A082532 a(n)=1 for n in A001541.
%K A082532 easy,nonn
%O A082532 1,2
%A A082532 _Carmine Suriano_, May 01 2003