cp's OEIS Frontend

A336933 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007733(i) = A007733(j), for all i, j >= 1.

%I A336933 #5 Aug 10 2020 22:19:37
%S A336933 1,1,2,1,3,2,4,1,5,3,6,2,7,4,3,1,8,5,9,3,5,6,10,2,11,7,9,4,12,3,13,1,
%T A336933 6,8,7,5,14,9,7,3,11,5,15,6,7,10,16,2,17,11,8,7,18,9,11,4,9,12,19,3,
%U A336933 20,13,5,1,7,6,21,8,22,7,23,5,24,14,11,9,25,7,26,3,27,11,28,5,8,15,12,6,10,7,7,10,6,16,14,2,29,17,25,11,30,8,31,7,7
%N A336933 Lexicographically earliest infinite sequence such that a(i) = a(j) => A007733(i) = A007733(j), for all i, j >= 1.
%C A336933 Restricted growth sequence transform of A007733.
%H A336933 Antti Karttunen, <a href="/A336933/b336933.txt">Table of n, a(n) for n = 1..65537</a>
%o A336933 (PARI)
%o A336933 up_to = 65537;
%o A336933 rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
%o A336933 A007733(n) = znorder(Mod(2, n/2^valuation(n, 2))); \\ From A007733
%o A336933 v336933 = rgs_transform(vector(up_to, n, A007733(n)));
%o A336933 A336933(n) = v336933[n];
%Y A336933 Cf. A007733, A336934, A336935, A336936.
%K A336933 nonn
%O A336933 1,3
%A A336933 _Antti Karttunen_, Aug 10 2020