A286712 a(n) = SumXOR_{k=1..n} A286681(k), where SumXOR is the analog of summation under the binary XOR operation.

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, 26, 54, 28, 58, 30, 62, 96, 66, 34, 99, 72, 101, 76, 39, 104, 82, 106, 86, 44, 90, 110, 94, 112, 99, 50, 102, 52, 107, 118, 111, 112, 57, 122, 119, 60, 122, 62, 126

Offset

1,2

Comments

For any n>0, a(n) written in binary contains binary n as a substring,

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, ...

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Perl program for A286712

Example

a(3) = A286681(1) XOR A286681(2) XOR A286681(3) = 1 XOR 3 XOR 4 = 6.

Crossrefs

Cf. A286681.

Sequence in context: A351500 A365902 A303823 * A268716 A204985 A255066

Adjacent sequences: A286709 A286710 A286711 * A286713 A286714 A286715

Keyword

nonn,look,base

Author

Rémy Sigrist, May 13 2017

Status

approved