The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101266 First differences of A101402. 1
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS All terms are 0 or 1, see comment in A101402. - Charles R Greathouse IV, Aug 27 2014 LINKS MAPLE 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 MATHEMATICA 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 *) CROSSREFS Cf. A101402. Sequence in context: A214264 A173858 A217586 * A260552 A244612 A262805 Adjacent sequences:  A101263 A101264 A101265 * A101267 A101268 A101269 KEYWORD easy,nonn AUTHOR Odimar Fabeny, Jan 23 2005 EXTENSIONS More terms from R. J. Mathar, Aug 17 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 22:21 EST 2021. Contains 340443 sequences. (Running on oeis4.)