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 A022804 #22 Sep 08 2022 08:44:46
%S A022804 4,8,14,18,24,28,32,38,42,48,52,56,62,66,72,76,82,86,90,96,100,106,
%T A022804 110,114,120,124,130,134,140,144,148,154,158,164,168,172,178,182,188,
%U A022804 192,196,202,206,212,216,222,226,230,236,240,246,250,254,260
%N A022804 a(n) = B(n) + c(n) where B(n) is Beatty sequence [ n*sqrt(2) ] and c is the complement of B.
%H A022804 Clark Kimberling, <a href="/A022804/b022804.txt">Table of n, a(n) for n = 1..10000</a>
%H A022804 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A022804 a(n) = 2*A003151(n) = 2*(n + floor(n*sqrt(2))).
%t A022804 Table[2 n + 2 Floor[n*Sqrt[2]], {n, 1, 200}]
%o A022804 (PARI) vector(100, n, 2*(n+floor(n*sqrt(2)))) \\ _G. C. Greubel_, Sep 08 2018
%o A022804 (Magma) [2*(n + Floor(n*Sqrt(2))): n in [1..100]]; // _G. C. Greubel_, Sep 08 2018
%K A022804 nonn
%O A022804 1,1
%A A022804 _Clark Kimberling_