cp's OEIS Frontend

A353717 a(n) = index of n in A353709, or -1 if n does not appear there.

%I A353717 #8 May 09 2022 23:09:07
%S A353717 0,1,2,5,3,13,10,53,4,22,14,56,7,34,17,76,6,9,20,69,24,38,42,86,28,31,
%T A353717 49,90,46,185,73,245,8,19,23,26,30,50,94,322,11,102,39,105,70,109,252,
%U A353717 549,15,65,98,117,80,83,124,1047,113,225,242,692,249,1209,553,1647,12,16,29,114,21,137,63,329,25,99,133,312,60,140,339,1007,54,175,148,189,57,238
%N A353717 a(n) = index of n in A353709, or -1 if n does not appear there.
%C A353717 If, as conjectured, A353709 is a permutation of the nonnegative integers, then this is the inverse permutation.
%H A353717 Rémy Sigrist, <a href="/A353717/b353717.txt">Table of n, a(n) for n = 0..16383</a>
%H A353717 Rémy Sigrist, <a href="/A353717/a353717.txt">C++ program</a>
%p A353717 b:= proc() false end: t:= 2:
%p A353717 g:= proc(n) option remember; global t; local k; if n<2 then n
%p A353717       else for k from t while b(k) or Bits[And](k, g(n-2))>0
%p A353717       or Bits[And](k, g(n-1))>0 do od; b(k):=true;
%p A353717       while b(t) do t:=t+1 od; k fi
%p A353717     end:
%p A353717 a:= proc() local t, a; t, a:= -1, proc() -1 end;
%p A353717       proc(n) local h;
%p A353717         while a(n) = -1 do
%p A353717           t:= t+1; h:= g(t);
%p A353717           if a(h) = -1 then a(h):= t fi
%p A353717         od; a(n)
%p A353717       end
%p A353717     end():
%p A353717 seq(a(n), n=0..85);  # _Alois P. Heinz_, May 09 2022
%o A353717 (C++) See Links section.
%Y A353717 Cf. A353709.
%K A353717 nonn
%O A353717 0,3
%A A353717 _N. J. A. Sloane_, May 09 2022