A161974 -id:A161974 - cp's OEIS frontend

A162311 Numbers such that A010060(n) = A010060(n+7).

1, 3, 4, 5, 7, 10, 14, 17, 19, 20, 21, 23, 25, 27, 28, 29, 31, 33, 35, 36, 37, 39, 42, 46, 49, 51, 52, 53, 55, 58, 62

Offset: 1

Vladimir Shevelev, Jul 01 2009

Or union of intersection of A161673 and {A121539(n)-7} and intersection of A161639 and {A079523(n)-7}.

Conjecture: In every sequence of numbers n, such that A010060(n)=A010060(n+k), for fixed odd k, the odious (A000069) and evil (A001969) terms alternate. - Vladimir Shevelev, Jul 31 2009

Charles R Greathouse IV, 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.

Cf. A161890, A161824, A161817, A161674, A161673, A161639, A161641, A161627, A161579, A161580, A121539, A131323, A036554, A010060, A079523, A081706, A161916, A161974.

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 <= 20000, n++, If[tm[n] == tm[n + 7], Sow[n]]]][[2, 1]] (* G. C. Greubel, Jan 05 2018 *)

is(n)=hammingweight(n)%2==hammingweight(n+7)%2 \\ Charles R Greathouse IV, Aug 20 2013

cp's OEIS Frontend

A162311 Numbers such that A010060(n) = A010060(n+7).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI