|
|
A014707
|
|
a(4n) = 0, a(4n+2) = 1, a(2n+1) = a(n).
|
|
22
|
|
|
0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The regular paper-folding (or dragon curve) sequence.
Runs of three consecutive ones appear around positions n = 22, 46, 54, 86, 94, 118, 150, 174, 182, ..., or for n of the form 2^(k+3)*(4*t+3)-2, k >= 0, t >= 0. - Vladimir Shevelev, Mar 19 2011
|
|
REFERENCES
|
G. Melançon, Factorizing infinite words using Maple, MapleTech journal, vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
|
|
LINKS
|
|
|
FORMULA
|
Set a=0, b=1, S(0)=a, S(n+1) = S(n)aF(S(n)), where F(x) reverses x and then interchanges a and b; sequence is limit S(infinity).
|
|
MAPLE
|
nmax:=92: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 0 to ceil(nmax/(p+2))+1 do a((2*n+1)*2^p-1) := n mod 2 od: od: seq(a(n), n=0..nmax); # Johannes W. Meijer, Jan 28 2013
# second Maple program:
a:= proc(n) option remember;
`if`(n::even, irem(n/2, 2), a((n-1)/2))
end:
|
|
MATHEMATICA
|
a[n_ /; Mod[n, 4] == 0] = 0; a[n_ /; Mod[n, 4] == 2] = 1; a[n_ /; Mod[n, 2] == 1] := a[n] = a[(n - 1)/2]; Table[a[n], {n, 0, 92}] (* Jean-François Alcover, May 17 2011 *)
|
|
PROG
|
(Haskell)
a014707 n = a014707_list !! n
a014707_list = f 0 $ cycle [0, 0, 1, 0] where
f i (x:_:xs) = x : a014707 i : f (i+1) xs
(Python)
s = bin(n+1)[2:]
m = len(s)
i = s[::-1].find('1')
return int(s[m-i-2]) if m-i-2 >= 0 else 0 # Chai Wah Wu, Apr 08 2021
(PARI) a(n)=n+=1; my(h=bitand(n, -n)); n=bitand(n, h<<1); n!=0; \\ Joerg Arndt, Apr 09 2021
|
|
CROSSREFS
|
Equals 1 - A014577, which see for further references. Also a(n) = A038189(n+1).
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Scott C. Lindhurst (ScottL(AT)alumni.princeton.edu)
|
|
STATUS
|
approved
|
|
|
|