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 A110117 #19 Feb 16 2025 08:32:58
%S A110117 3,6,9,12,15,18,22,25,28,31,34,37,40,44,47,50,53,56,59,62,66,69,72,75,
%T A110117 78,81,84,88,91,94,97,100,103,106,110,113,116,119,122,125,128,132,135,
%U A110117 138,141,144,147,151,154,157,160,163,166,169,173,176,179,182,185,188
%N A110117 a(n) = floor(n * (sqrt(2) + sqrt(3))).
%C A110117 Beatty sequence for sqrt(2)+sqrt(3); complement of A110118;
%C A110117 sqrt(2)+sqrt(3) = 3.14626... = A135611, a weak but interesting Pi approximation.
%H A110117 G. C. Greubel, <a href="/A110117/b110117.txt">Table of n, a(n) for n = 1..5000</a>
%H A110117 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PiApproximations.html">Pi Approximations</a>
%H A110117 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>
%H A110117 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%t A110117 Table[Floor[n*(Sqrt[2] + Sqrt[3])], {n, 1, 50}] (* _G. C. Greubel_, Jul 02 2017 *)
%o A110117 (PARI) for(n=1,50, print1(floor(n*(sqrt(2) + sqrt(3))), ", ")) \\ _G. C. Greubel_, Jul 02 2017
%Y A110117 Cf. A110119, A135611.
%K A110117 nonn
%O A110117 1,1
%A A110117 _Reinhard Zumkeller_, Jul 13 2005
%E A110117 Typo in Link section fixed by _Reinhard Zumkeller_, Feb 15 2010