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 A282162 #21 May 05 2025 16:35:12
%S A282162 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,3,
%T A282162 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3,2,3,3,
%U A282162 2,3,2,3,3,2,3,2,3,3,2,3,3,2,3,2,3,3
%N A282162 Difference sequence of the upper Wythoff sequence, A001950, with 2 prepended.
%C A282162 Another version of the infinite Fibonacci word (see Formula). Start with 2, apply 2->23, 3->233, and take the limit.
%H A282162 Clark Kimberling, <a href="/A282162/b282162.txt">Table of n, a(n) for n = 0..10000</a>
%F A282162 a(n) = 1 + A001468(n).
%t A282162 r = GoldenRatio^2; Table[Floor[(n + 1) r] - Floor[n r], {n, 0, 120}]
%o A282162 (Python)
%o A282162 from math import isqrt
%o A282162 def A282162(n): return (n+3+isqrt(m:=5*(n+1)**2)>>1)-(n+isqrt(m-10*n-5)>>1) # _Chai Wah Wu_, May 05 2025
%Y A282162 Cf. A001950, A001468, A076662.
%K A282162 nonn,easy
%O A282162 0,1
%A A282162 _Clark Kimberling_, Feb 09 2017