cp's OEIS Frontend

A322313 Lexicographically earliest such sequence a that a(i) = a(j) => A322312(i) = A322312(j) for all i, j.

%I A322313 #7 Dec 03 2018 18:30:20
%S A322313 1,2,1,3,1,4,1,5,1,6,1,7,1,2,1,8,1,9,1,9,1,6,1,10,1,2,1,11,1,12,1,13,
%T A322313 1,2,1,14,1,2,1,10,1,15,1,11,1,6,1,16,1,6,1,11,1,17,1,18,1,6,1,19,1,2,
%U A322313 1,20,1,12,1,3,1,21,1,22,1,2,1,3,1,23,1,16,1,6,1,24,1,2,1,25,1,26,1,11,1,2,1,27,1,2,1,28,1,23,1,18,1
%N A322313 Lexicographically earliest such sequence a that a(i) = a(j) => A322312(i) = A322312(j) for all i, j.
%C A322313 Restricted growth sequence transform of A322312.
%H A322313 Antti Karttunen, <a href="/A322313/b322313.txt">Table of n, a(n) for n = 1..65537</a>
%o A322313 (PARI)
%o A322313 up_to = 65537;
%o A322313 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 A322313 A322312(n) = { my(m=1,p); fordiv(n,d,p=1+d; if(isprime(p), for(i=0,oo,if(n%(p^i),m *= prime(i);break)))); (m); };
%o A322313 v322313 = rgs_transform(vector(up_to, n, A322312(n)));
%o A322313 A322313(n) = v322313[n];
%Y A322313 Cf. A322312, A322315.
%K A322313 nonn
%O A322313 1,2
%A A322313 _Antti Karttunen_, Dec 03 2018