A372569 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.
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, 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, 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
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..65537
Programs
-
PARI
up_to = 65537; 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; }; Aux372569(n) = [gcd(n, sigma(n)), gcd(n, eulerphi(n)), gcd(eulerphi(n), sigma(n))]; v372569 = rgs_transform(vector(up_to, n, Aux372569(n))); A372569(n) = v372569[n];
Comments