login

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”).

A161580
Positions n such that A010060(n) + A010060(n+3) = 1.
13
2, 5, 7, 10, 14, 18, 21, 23, 26, 29, 31, 34, 37, 39, 42, 46, 50, 53, 55, 58, 62, 66, 69, 71, 74, 78, 82, 85, 87, 90, 93, 95, 98, 101, 103, 106, 110, 114, 117, 119, 122, 125, 127, 130, 133, 135, 138, 142, 146, 149, 151, 154, 157, 159, 162, 165, 167, 170, 174, 178, 181, 183, 186
OFFSET
1,1
COMMENTS
Conjecture: In every sequence of numbers n such that A010060(n) + A010060(n+k) = 1, for fixed odd k, the odious (A000069) and evil (A001969) terms alternate. [From Vladimir Shevelev, Jul 31 2009]
LINKS
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]
FORMULA
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+3] == 1, Sow[n]]]][[2, 1]] (* Jean-François Alcover, Oct 24 2013 *)
PROG
(PARI) is(n)=hammingweight(n)%2+hammingweight(n+3)%2==1 \\ Charles R Greathouse IV, Mar 22 2013
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Jun 14 2009
EXTENSIONS
More terms from R. J. Mathar, Aug 17 2009
STATUS
approved