OFFSET
0,1
COMMENTS
LINKS
N. J. A. Sloane, Transforms: Maple implementation of binary eXclusive OR (XORnos).
FORMULA
a(n) = product('((bit_i((n+1), i)*(2^(2^(i+1))))+1)', 'i'=0..floor_log_2(n+2)) + 2*product('((bit_i(n, i)*(2^(2^(i+1))))+1)', 'i'=0..floor_log_2(n+1));
MAPLE
# Maple procedure for doing Shift XOR adjacent terms transformation:
SHIFTXORADJ := proc(a) local b, i:
if whattype(a) <> list then RETURN([ ]); fi: if nops(a) <= 1 then RETURN([ ]); fi: b := [ ]:
for i from 2 to nops(a) do b := [ op(b), XORnos((a[ i-1 ]*2), a[ i ]) ]: od: RETURN(b); end:
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved