|
Search: id:A101266
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
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) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 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 [From Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 17 2009]
|
|
CROSSREFS
|
Cf. A101402.
Sequence in context: A089013 A123504 A104015 this_sequence A105367 A065043 A121559
Adjacent sequences: A101263 A101264 A101265 this_sequence A101267 A101268 A101269
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Odimar Fabeny (aifab(AT)yahoo.com.br), Jan 23 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 17 2009
|
|
|
Search completed in 0.002 seconds
|
