%I #8 Mar 28 2019 09:29:13
%S 1,2,6,4,13,6,14,8,25,21,27,28,61,56,47,32,17,50,38,52,42,54,46,56,50,
%T 26,54,28,58,30,62,96,66,34,99,72,101,76,39,104,82,106,86,44,90,110,
%U 94,112,99,50,102,52,107,118,111,112,57,122,119,60,122,62,126
%N a(n) = SumXOR_{k=1..n} A286681(k), where SumXOR is the analog of summation under the binary XOR operation.
%C For any n>0, a(n) written in binary contains binary n as a substring,
%C For any n>0, a(n) >= n, with equality for n = 1, 2, 4, 6, 8, 17, 26, 28, 30, 34, 39, 44, 50, 52, 57, 60, 62, 64, 71, 76, 78, 83, 129, 134, 140, ...
%H Rémy Sigrist, <a href="/A286712/b286712.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A286712/a286712.pl.txt">Perl program for A286712</a>
%e a(3) = A286681(1) XOR A286681(2) XOR A286681(3) = 1 XOR 3 XOR 4 = 6.
%Y Cf. A286681.
%K nonn,look,base
%O 1,2
%A _Rémy Sigrist_, May 13 2017