The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161673 Positions n such that A010060(n) + A010060(n+8) = 1. 8
 0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, 51, 52, 53, 54, 55, 64, 65, 66, 67, 68, 69, 70, 71, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Also union of numbers of the form 8*A121539(n)+k, 0<=k<8. Generalization: the numbers n such that A010060(n)+A010060(n+2^m)=1 constitute the union of sequences {2^m*A121539(n)+k}, k=0,1,...,2^m-1. LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA A001477 \ A161639. 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 <= 6000, n++, If[tm[n] + tm[n + 8] == 1, Sow[n]]]][[2, 1]] (* G. C. Greubel, Jan 05 2018 *) PROG (PARI) is(n)=hammingweight(n)%2!=hammingweight(n+8)%2 \\ Charles R Greathouse IV, Aug 20 2013 CROSSREFS Cf. A161639, A161641, A161627, A161579, A161580, A121539, A079523, A131323, A036554, A010060, A121539, A079523, A081706. Sequence in context: A264974 A334953 A308334 * A309126 A004836 A039030 Adjacent sequences:  A161670 A161671 A161672 * A161674 A161675 A161676 KEYWORD nonn AUTHOR Vladimir Shevelev, Jun 16 2009 EXTENSIONS Edited and extended by R. J. Mathar, Sep 02 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 12:11 EDT 2021. Contains 342949 sequences. (Running on oeis4.)