cp's OEIS Frontend

A322590 Lexicographically earliest such positive sequence a that a(i) = a(j) => A007947(i) = A007947(j) for all i, j.

%I A322590 #8 Dec 17 2018 16:20:59
%S A322590 1,2,3,2,4,5,6,2,3,7,8,5,9,10,11,2,12,5,13,7,14,15,16,5,4,17,3,10,18,
%T A322590 19,20,2,21,22,23,5,24,25,26,7,27,28,29,15,11,30,31,5,6,7,32,17,33,5,
%U A322590 34,10,35,36,37,19,38,39,14,2,40,41,42,22,43,44,45,5,46,47,11,25,48,49,50,7,3,51,52,28,53,54,55,15,56,19,57,30,58,59,60,5,61,10,21,7,62,63,64,17
%N A322590 Lexicographically earliest such positive sequence a that a(i) = a(j) => A007947(i) = A007947(j) for all i, j.
%C A322590 Restricted growth sequence transform of A007947.
%H A322590 Antti Karttunen, <a href="/A322590/b322590.txt">Table of n, a(n) for n = 1..65537</a>
%F A322590 a(n) = 1 + A285329(n).
%o A322590 (PARI)
%o A322590 up_to = 65537;
%o A322590 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 A322590 A007947(n) = factorback(factorint(n)[, 1]);
%o A322590 v322590 = rgs_transform(vector(up_to, n, A007947(n)));
%o A322590 A322590(n) = v322590[n];
%Y A322590 Cf. A007947, A008479 (ordinal transform).
%Y A322590 One more than A285329.
%K A322590 nonn
%O A322590 1,2
%A A322590 _Antti Karttunen_, Dec 17 2018