Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 May 25 2024 16:59:45
%S 1,1,2,3,2,4,2,5,6,7,2,8,2,9,10,11,2,12,2,13,14,7,2,15,16,9,17,18,2,
%T 19,2,20,21,7,22,23,2,9,24,25,2,26,2,8,27,7,2,28,29,30,10,13,2,31,32,
%U 33,14,7,2,34,2,9,35,36,37,38,2,13,21,39,2,40,2,9,41,8,37,42,2,43,44,7,2,45,46,9,10,47,2,48,49,8,14,7,50,51,2,52,53,54,2,19,2
%N Lexicographically earliest infinite sequence such that a(i) = a(j) => A009194(i) = A009194(j), A009195(i) = A009195(j) and A009223(i) = A009223(j), for all i, j >= 1.
%C Restricted growth sequence transform of the triple [A009194(n), A009195(n), A009223(n)].
%C For all i, j: A372570(i) = A372570(j) => a(i) = a(j) => A074389(i) = A074389(j).
%H Antti Karttunen, <a href="/A372569/b372569.txt">Table of n, a(n) for n = 1..65537</a>
%o (PARI)
%o up_to = 65537;
%o 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 Aux372569(n) = [gcd(n, sigma(n)), gcd(n, eulerphi(n)), gcd(eulerphi(n), sigma(n))];
%o v372569 = rgs_transform(vector(up_to, n, Aux372569(n)));
%o A372569(n) = v372569[n];
%Y Cf. A009194, A009195, A009223.
%Y Cf. also A372570, A372572.
%K nonn
%O 1,3
%A _Antti Karttunen_, May 25 2024