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 A183138 #14 Sep 08 2022 08:45:55
%S A183138 0,0,0,1,1,1,2,2,2,2,3,3,3,4,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9,
%T A183138 10,10,10,11,11,11,12,12,12,12,13,13,13,14,14,14,14,15,15,15,16,16,16,
%U A183138 16,17,17,17,18,18,18,19,19,19,19,20,20,20
%N A183138 a(n) = floor(n/(2+sqrt(2))).
%C A183138 A083051(n) = 2*n+1 + floor(n*sqrt(2)) is the location of the least k for which a(k)=n.
%H A183138 G. C. Greubel, <a href="/A183138/b183138.txt">Table of n, a(n) for n = 1..10000</a>
%F A183138 a(n) = floor(n/(2+sqrt(2))).
%t A183138 With[{c=2+Sqrt[2]},Table[Floor[n/c],{n,80}]] (* _Harvey P. Dale_, Jun 21 2017 *)
%o A183138 (PARI) for(n=1,100, print1(floor(n/(2+sqrt(2))), ", ")) \\ _G. C. Greubel_ Apr 10 2018
%o A183138 (Magma) [Floor(n/(2+Sqrt(2))): n in [1..100]]; // _G. C. Greubel_, Apr 10 2018
%Y A183138 Cf. A183140. Beatty sequence of A268682.
%K A183138 nonn
%O A183138 1,7
%A A183138 _Clark Kimberling_, Dec 26 2010