Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Aug 29 2022 17:35:06
%S 3,7,5,13,9,11,10,14,6,15,12,28,20,21,17,19,18,22,26,23,25,24,27,35,
%T 31,37,29,39,30,38,34,42,40,41,33,43,44,36,45,49,47,50,46,51,48,52,56,
%U 53,58,74,59,67,55,69,61,71,54,57,73,63,70,62,75,65,77,60
%N a(n) is the smallest positive integer not yet in the sequence such that the binary representation of a(n) AND a(n-1) contains exactly two 1-bits, starting a(1) = 3.
%C This is a permutation of the positive nonpowers of 2, or of { A057716 } \ {0}.
%H Alois P. Heinz, <a href="/A352670/b352670.txt">Table of n, a(n) for n = 1..65536</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Bitwise operation">Bitwise operation</a>
%Y Cf. A000079, A057716, A109812, A226077.
%K nonn,look
%O 1,1
%A _Alois P. Heinz_, Mar 28 2022