This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A306869 #10 Mar 17 2019 21:12:05 %S A306869 1,2,3,4,6,5,7,8,12,10,13,11,14,9,15,16,24,20,26,21,27,22,25,23,28,18, %T A306869 29,19,30,17,31,32,48,40,52,42,53,43,54,41,55,44,50,45,51,46,49,47,56, %U A306869 36,58,37,59,38,57,39,60,34,61,35,62,33,63,64,96,80,104 %N A306869 Lexicographically earliest sequence of distinct positive terms such that the binary representation of the bitwise-OR of two consecutive terms has exactly one run of consecutive ones. %C A306869 This sequence has similarities with A175343; in both sequences, the binary representation of the bitwise OR of two consecutive terms has exactly one run of consecutive ones. %H A306869 Rémy Sigrist, <a href="/A306869/b306869.txt">Table of n, a(n) for n = 1..8192</a> %H A306869 Rémy Sigrist, <a href="/A306869/a306869_1.gp.txt">PARI program for A306869</a> %F A306869 A069010(a(n) OR a(n+1)) = 1. %e A306869 The first terms, alongside the binary representation of a(n) OR a(n+1), are: %e A306869 a a(n) bin(a(n) OR a(n+1)) %e A306869 -- ---- ------------------- %e A306869 1 1 11 %e A306869 2 2 11 %e A306869 3 3 111 %e A306869 4 4 110 %e A306869 5 6 111 %e A306869 6 5 111 %e A306869 7 7 1111 %e A306869 8 8 1100 %e A306869 9 12 1110 %e A306869 10 10 1111 %e A306869 11 13 1111 %e A306869 12 11 1111 %e A306869 13 14 1111 %e A306869 14 9 1111 %e A306869 15 15 11111 %e A306869 16 16 11000 %o A306869 (PARI) See Links section. %Y A306869 Cf. A069010, A175343. %K A306869 nonn,base %O A306869 1,2 %A A306869 _Rémy Sigrist_, Mar 14 2019