OFFSET
1,1
COMMENTS
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..10000
J.-P. Allouche, Thue, Combinatorics on words, and conjectures inspired by the Thue-Morse sequence, arXiv:1401.3727 [math.NT], 2014.
J.-P. Allouche, Thue, Combinatorics on words, and conjectures inspired by the Thue-Morse sequence, J. de Théorie des Nombres de Bordeaux, 27, no. 2 (2015), 375-388.
V. Shevelev, Equations of the form t(x+a)=t(x) and t(x+a)=1-t(x) for Thue-Morse sequence arXiv:0907.0880 [math.NT], 2009-2012. [Vladimir Shevelev, Jul 31 2009]
MATHEMATICA
tm[0] = 0; tm[n_?EvenQ] := tm[n] = tm[n/2]; tm[n_] := tm[n] = 1 - tm[(n-1)/2]; Reap[For[n = 0, n <= 200, n++, If[tm[n] == tm[n+8], Sow[n]]]][[2, 1]] (* Jean-François Alcover, Oct 24 2013 *)
SequencePosition[ThueMorse[Range[0, 200]], {x_, _, _, _, _, _, _, _, x_}][[All, 1]]-1 (* Harvey P. Dale, Jul 23 2021 *)
PROG
(PARI) is(n)=hammingweight(n)%2==hammingweight(n+8)%2 \\ Charles R Greathouse IV, Aug 20 2013
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Vladimir Shevelev, Jun 15 2009
EXTENSIONS
Duplicate of 174 removed by R. J. Mathar, Aug 28 2009
STATUS
approved