login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = A333555(1) XOR ... XOR A333555(n) (where XOR denotes the bitwise XOR operator).
2

%I #9 Mar 28 2020 17:51:22

%S 1,3,7,15,10,26,58,43,107,121,92,220,207,232,160,134,152,408,396,430,

%T 492,262,774,784,825,862,1008,754,718,546,1570,1589,1650,1600,1867,

%U 1875,2042,1524,1419,1174,3222,3210,3237,3102,3163,3361,3882,3642,2589,2930

%N a(n) = A333555(1) XOR ... XOR A333555(n) (where XOR denotes the bitwise XOR operator).

%C All terms are distinct.

%H Rémy Sigrist, <a href="/A333556/b333556.txt">Table of n, a(n) for n = 1..8747</a>

%H Rémy Sigrist, <a href="/A333556/a333556.txt">C program for A333556</a>

%e a(3) = A333555(1) XOR A333555(2) XOR A333555(3) = 1 XOR 2 XOR 4 = 7.

%o (C) See Links section.

%Y Cf. A333555.

%K nonn,look,base

%O 1,2

%A _Rémy Sigrist_, Mar 26 2020