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 A276870 #9 Sep 08 2022 08:46:17
%S A276870 3,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3,3,3,3,
%T A276870 4,3,3,3,3,3,3,4,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3,3,3,3,
%U A276870 4,3,3,3,3,3,3,4,3,3,3,3,3,3,4,3,3,3
%N A276870 First differences of the Beatty sequence A110117 for sqrt(2) + sqrt(3).
%H A276870 Clark Kimberling, <a href="/A276870/b276870.txt">Table of n, a(n) for n = 1..10000</a>
%F A276870 a(n) = floor(n*r) - floor(n*r - r), where r = sqrt(2) + sqrt(3), n >= 1.
%t A276870 z = 500; r = Sqrt[2]+Sqrt[3]; b = Table[Floor[k*r], {k, 0, z}] (* A110117 *)
%t A276870 Differences[b] (* A276870 *)
%o A276870 (PARI) vector(100, n, floor(n*(sqrt(2) + sqrt(3))) - floor((n-1)*(sqrt(2)+sqrt(3)))) \\ _G. C. Greubel_, Aug 16 2018
%o A276870 (Magma) [Floor(n*(Sqrt(2) + Sqrt(3))) - Floor((n-1)*(Sqrt(2) + Sqrt(3))): n in [1..100]]; // _G. C. Greubel_, Aug 16 2018
%Y A276870 Cf. A110117, A276889.
%K A276870 nonn,easy
%O A276870 1,1
%A A276870 _Clark Kimberling_, Sep 26 2016