|
%I #12 Mar 17 2019 21:09:46
%S 1,4,2,6,8,3,9,5,12,10,11,16,7,17,13,20,14,18,19,21,22,23,32,15,33,24,
%T 25,26,27,34,28,29,36,30,38,35,37,39,40,47,41,46,43,44,48,45,42,49,50,
%U 51,52,55,53,54,56,57,58,59,64,31,65,60,61,68,62,66,67
%N 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 zeros.
%C This sequence is a variant of A306869.
%H Rémy Sigrist, <a href="/A306874/b306874.txt">Table of n, a(n) for n = 1..16384</a>
%H Rémy Sigrist, <a href="/A306874/a306874_1.gp.txt">PARI program for A306874</a>
%F A087116(a(n) OR a(n+1)) = 1.
%e The first terms, alongside the binary representation of a(n) OR a(n+1), are:
%e n a(n) bin(a(n) OR a(n+1))
%e -- ---- -------------------
%e 1 1 101
%e 2 4 110
%e 3 2 110
%e 4 6 1110
%e 5 8 1011
%e 6 3 1011
%e 7 9 1101
%e 8 5 1101
%e 9 12 1110
%e 10 10 1011
%e 11 11 11011
%e 12 16 10111
%e 13 7 10111
%e 14 17 11101
%e 15 13 11101
%o (PARI) See Links section.
%Y Cf. A087116, A306869.
%K nonn,base,look
%O 1,2
%A _Rémy Sigrist_, Mar 14 2019
|
