OFFSET
1,3
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
FORMULA
a(1)=1, a(n) = sum ( a(i) XOR a(n-i), i = 1 .. n-1).
MAPLE
a:= proc(n) option remember; `if`(n=0, 1, add(
Bits[Xor](a(i), a(n-1-i)), i=0..n-1))
end:
seq(a(n), n=0..35); # Alois P. Heinz, Jun 16 2018
MATHEMATICA
a[1] = 1; a[n_] := a[n] = Sum[BitXor[a[i], a[n - i]], {i, 1, n - 1}]; Table[a[n], {n, 30}]
PROG
(Haskell)
import Data.Bits (xor)
a199770 n = a199770_list !! (n-1)
a199770_list = 1 : f [1] where
f xs = y : f (y : xs) where
y = sum $ zipWith xor xs $ reverse xs :: Integer
-- Reinhard Zumkeller, Jul 15 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jacob A. Siehler, Nov 10 2011
STATUS
approved