A286681 a(n) = the smallest positive integer not occurring earlier in the sequence such that SumXOR_{k=1..n} a(k) written in binary contains binary n as a substring, where SumXOR is the analog of summation under the binary XOR operation.

1, 3, 4, 2, 9, 11, 8, 6, 17, 12, 14, 7, 33, 5, 23, 15, 49, 35, 20, 18, 30, 28, 24, 22, 10, 40, 44, 42, 38, 36, 32, 94, 34, 96, 65, 43, 45, 41, 107, 79, 58, 56, 60, 122, 118, 52, 48, 46, 19, 81, 84, 82, 95, 29, 25, 31, 73, 67, 13, 75, 70, 68, 64, 62, 129, 69

Offset

1,2

Comments

This sequence is a variant of A160855: here we consider SumXOR, there Sum.

The partial XOR sums are given by A286712.

Links

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

Rémy Sigrist, Perl program for A286681

Rémy Sigrist, Illustration of the first terms

Crossrefs

Cf. A160855, A286712.

Sequence in context: A145421 A338245 A352417 * A019474 A366896 A072565

Adjacent sequences: A286678 A286679 A286680 * A286682 A286683 A286684

Keyword

nonn,base,look

Author

Rémy Sigrist, May 13 2017

Status

approved