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 A051105 #9 Mar 28 2022 07:45:16
%S A051105 0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,0,1,1,0,1,0,1,1,1,1,0,
%T A051105 1,1,0,1,1,1,0,1,0,0,1,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,0,0,1,0,1,
%U A051105 1,1,1,1,1,1,0,1,0,0,1,1,1,1,0,1,0,1,1,1,1,0,1,0,1
%N A051105 First differences of A005229.
%H A051105 G. C. Greubel, <a href="/A051105/b051105.txt">Table of n, a(n) for n = 1..5000</a>
%F A051105 a(n) = A005229(n+1) - A005229(n). - _G. C. Greubel_, Mar 28 2022
%t A051105 b[n_]:= b[n]= If[n<3, 1, b[b[n-2]] + b[n-b[n-2]]]; (* A005229 *)
%t A051105 A051105[n_]:= A051105[n] = b[n+1] -b[n];
%t A051105 Table[A051105[n], {n, 100}] (* _G. C. Greubel_, Mar 27 2022 *)
%o A051105 (Sage)
%o A051105 @CachedFunction
%o A051105 def b(n): # A005229
%o A051105 if (n<3): return 1
%o A051105 else: return b(b(n-2)) + b(n-b(n-2))
%o A051105 def A051105(n): return b(n+1) - b(n)
%o A051105 [A051105(n) for n in (1..100)] # _G. C. Greubel_, Mar 27 2022
%Y A051105 Cf. A005229.
%K A051105 nonn,easy
%O A051105 1,1
%A A051105 _N. J. A. Sloane_