This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 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 (list; graph; refs; listen; history; text; internal format)
 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: A091477 A075593 A145421 * A019474 A072565 A159672 Adjacent sequences:  A286678 A286679 A286680 * A286682 A286683 A286684 KEYWORD nonn,base,look AUTHOR Rémy Sigrist, May 13 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 22 00:43 EDT 2019. Contains 326169 sequences. (Running on oeis4.)