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 A114761 #18 Mar 08 2025 01:29:14
%S A114761 1,196,19881,1999396,199996164,19999899241,1999998409369,
%T A114761 199999982358225,19999999932878736,1999999998944727844,
%U A114761 199999999979325598129,19999999999912458800169,1999999999999731161391129,199999999999973116139112900,19999999999999857198323561481
%N A114761 a(n) = (floor(sqrt(2)*10^n))^2.
%H A114761 G. C. Greubel, <a href="/A114761/b114761.txt">Table of n, a(n) for n = 0..495</a>
%e A114761 a(1) = floor(2^(1/2)*10)^2 = 14^2 = 196.
%t A114761 f[n_] := Floor[ Sqrt@2*10^n]^2; Table[ f[n], {n, 0, 12}] (* _Robert G. Wilson v_ *)
%o A114761 (PARI) a(n) = sqrtint(2*100^n)^2; \\ _G. C. Greubel_, Jul 05 2017
%Y A114761 Cf. A114762.
%K A114761 base,easy,nonn
%O A114761 0,2
%A A114761 _Amarnath Murthy_, Nov 17 2005
%E A114761 More terms from _Robert G. Wilson v_, Jan 03 2006
%E A114761 More terms from _Joshua Zucker_, May 05 2006