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 A050140 #38 Aug 26 2022 06:25:53
%S A050140 1,4,5,8,11,12,15,16,19,22,23,26,29,30,33,34,37,40,41,44,45,48,51,52,
%T A050140 55,58,59,62,63,66,69,70,73,76,77,80,81,84,87,88,91,92,95,98,99,102,
%U A050140 105,106,109,110,113,116,117,120,121,124,127,128,131,134,135,138,139
%N A050140 a(n) = 2*floor(n*phi)-n, where phi = (1+sqrt(5))/2.
%C A050140 Old name was a(n) = last number in repeating block in continued fraction for n*phi.
%D A050140 Alfred Brousseau, Fibonacci and Related Number Theoretic Tables, The Fibonacci Association, 1972, 101-103.
%H A050140 Clark Kimberling, <a href="/A050140/b050140.txt">Table of n, a(n) for n = 1..1000</a>
%H A050140 J.-P. Allouche and F. M. Dekking, <a href="https://arxiv.org/abs/1809.03424">Generalized Beatty sequences and complementary triples</a>, arXiv:1809.03424 [math.NT], 2018.
%F A050140 a(n) = -n + 2*floor(n*phi) = A283233(n)-n.
%F A050140 a(n) = floor(n*phi) + floor(n*sigma) where phi = (sqrt(5)+1)/2 and sigma = (sqrt(5)-1)/2.
%F A050140 a(n) = last number in repeating block in continued fraction for n*phi.
%t A050140 Table[-n+2Floor[n*GoldenRatio],{n,1,100}]
%o A050140 (PARI) for(n=1,50, print1(-n + 2*floor(n*(1+sqrt(5))/2), ", ")) \\ _G. C. Greubel_, Oct 15 2017
%o A050140 (Magma) [-n + 2*Floor(n*(1+Sqrt(5))/2): n in [1..50]]; // _G. C. Greubel_, Oct 15 2017
%o A050140 (Python)
%o A050140 def A050140(n): return (n+isqrt(5*n**2)&-2)-n # _Chai Wah Wu_, Aug 25 2022
%Y A050140 Cf. A000201, A001622, A005206, A050141, A005614, A001350.
%K A050140 nonn
%O A050140 1,2
%A A050140 _Clark Kimberling_
%E A050140 Formula and more terms from _Vladeta Jovovic_, Nov 23 2001
%E A050140 Name changed by _Michel Dekking_, Dec 27 2017