OFFSET
0,3
COMMENTS
Note that a(3n) = n.
LINKS
T. D. Noe, Table of n, a(n) for n = 0..1023
Eric Weisstein's World of Mathematics, XOR
Wikipedia, Bitwise operation XOR
MATHEMATICA
t = {0, 1}; Do[AppendTo[t, BitXor[n, t[[-1]], t[[-2]]]], {n, 2, 100}]; t (* T. D. Noe, Apr 18 2012 *)
nxt[{n_, a_, b_}]:={n+1, b, BitXor[a, b, n+1]}; Transpose[NestList[nxt, {1, 0, 1}, 100]] [[2]] (* Harvey P. Dale, Aug 14 2013 *)
PROG
(Python)
prpr = 0
prev = 1
print('0, 1', end=', ')
for i in range(2, 101):
current = prev ^ prpr ^ i
print(current, end=", ")
prpr = prev
prev = current
(Haskell)
import Data.Bits (xor)
a182182 n = a182182_list !! n
a182182_list = 0 : 1 : zipWith xor [2..]
(zipWith xor a182182_list $ tail a182182_list) :: [Integer]
-- Reinhard Zumkeller, Apr 23 2012
CROSSREFS
KEYWORD
AUTHOR
Alex Ratushnyak, Apr 17 2012
STATUS
approved