A101266 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A101266

First differences of A101402.

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

Table of n, a(n) for n=0..104.

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: A217586 A359156 A352569 * A260552 A373307 A244612

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