|
%I #11 Aug 08 2015 21:19:31
%S 1,0,0,1,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1,0,1,0,1,
%T 0,0,1,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1,0,0,1,0,0,
%U 1,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,1,0,1,0,1,0,0,1,0,1,0
%N First differences of A101402.
%C All terms are 0 or 1, see comment in A101402. - _Charles R Greathouse IV_, Aug 27 2014
%p A101402 := proc(n) option remember; local k; if n <=1 then n; else k := 2^ceil(log[2](n)) ; procname(k/2)+procname(n-1-k/2) ; fi; end: A101266 := proc(n) A101402(n+1)-A101402(n) ; end: seq(A101266(n),n=0..130) ; # _R. J. Mathar_, Aug 17 2009
%t a[0] = 0; a[1] = 1; a[n_] := a[n] = Block[{p = 2^(Ceiling[ Log[2, n]] - 1)}, a[p] + a[n - 1 - p]]; t = Table[ a@n, {n, 0, 101}]; Rest@t - Most@t (* _Robert G. Wilson v_, Aug 17 2009 *)
%Y Cf. A101402.
%K easy,nonn
%O 0,1
%A _Odimar Fabeny_, Jan 23 2005
%E More terms from _R. J. Mathar_, Aug 17 2009
|
