cp's OEIS Frontend

A353712 a(0)=0; thereafter a(n+1) = smallest missing nonnegative integer which is different from a(n)+1 and whose binary expansion has a 1-bit in common with the binary expansion of a(n)+1.

%I A353712 #13 May 07 2022 16:00:10
%S A353712 0,3,5,2,1,6,4,7,9,8,10,12,11,13,15,17,14,18,16,19,21,20,22,24,23,25,
%T A353712 27,26,28,30,29,31,33,32,34,36,35,37,39,38,40,42,41,43,45,44,46,48,47,
%U A353712 49,51,50,52,54,53,55,57,56,58,60,59,61,63,65,62,66,64,67
%N A353712 a(0)=0; thereafter a(n+1) = smallest missing nonnegative integer which is different from a(n)+1 and whose binary expansion has a 1-bit in common with the binary expansion of a(n)+1.
%C A353712 A set-theory analog of A347113.
%C A353712 This is a permutation of the nonnegative numbers.
%H A353712 Alois P. Heinz, <a href="/A353712/b353712.txt">Table of n, a(n) for n = 0..10000</a>
%H A353712 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the nonnegative integers</a>
%Y A353712 Cf. A347113, A353713.
%K A353712 nonn
%O A353712 0,2
%A A353712 _N. J. A. Sloane_, May 07 2022
%E A353712 More terms from _Alois P. Heinz_, May 07 2022