OFFSET
0,2
COMMENTS
Appears to be a self-convolution of an integer sequence (true for at least the initial 761 terms).
LINKS
Paul D. Hanna, Table of n, a(n) for n = 0..300
EXAMPLE
a(2) = 1 XOR 3 = 2; a(3) = 1 XOR 3 XOR 9 = 11; a(4) = 1 XOR 3 XOR 9 XOR 27 = 16.
MAPLE
A[0]:= 1:
for n from 1 to 40 do
A[n]:= Bits:-Xor(A[n-1], 3^n)
od:
seq(A[i], i=0..40); # Robert Israel, Nov 02 2015
MATHEMATICA
FoldList[BitXor, 3^Range[0, 28]] (* Vladimir Reshetnikov, Nov 02 2015 *)
PROG
(PARI) {a(n)=if(n<0, 0, bitxor(a(n-1), 3^n))}
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Paul D. Hanna, Nov 05 2011
STATUS
approved