login
a(0)=0, a(1)=1, a(n)=(a(n-1) XOR a(n-2)) + n.
2

%I #10 Nov 06 2024 15:26:51

%S 0,1,3,5,10,20,36,55,27,53,56,24,44,65,123,73,66,28,112,127,35,113,

%T 104,48,112,89,67,53,146,196,116,207,219,53,272,328,124,345,331,57,

%U 410,460,128,375,547,897,464,640,896,305,739,1029,1818,852,1156,2055,3259,1269,2184,3256,1132,2321,3515,1257,2450,3516,1136,2575

%N a(0)=0, a(1)=1, a(n)=(a(n-1) XOR a(n-2)) + n.

%F a(0)=0, a(1)=1, a(n)=(a(n-1) XOR a(n-2)) + n, where XOR is the bitwise exclusive-or operator.

%o (Python)

%o prpr, prev = 0,1

%o for n in range(2,99):

%o current = (prpr ^ prev) + n

%o print(prpr, end=', ')

%o prpr, prev = prev, current

%Y Cf. A114375, A182509.

%K nonn,base,easy

%O 0,3

%A _Alex Ratushnyak_, May 04 2012