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