A326201 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n > 1 and gcd(n,A000005(n)) = 1, with f(n) = n for all other numbers.

1, 2, 3, 3, 3, 4, 3, 5, 6, 7, 3, 8, 3, 9, 3, 3, 3, 10, 3, 11, 3, 12, 3, 13, 3, 14, 3, 15, 3, 16, 3, 17, 3, 18, 3, 19, 3, 20, 3, 21, 3, 22, 3, 23, 24, 25, 3, 26, 3, 27, 3, 28, 3, 29, 3, 30, 3, 31, 3, 32, 3, 33, 34, 3, 3, 35, 3, 36, 3, 37, 3, 38, 3, 39, 40, 41, 3, 42, 3, 43, 3, 44, 3, 45, 3, 46, 3, 47, 3, 48, 3, 49, 3, 50, 3, 51, 3, 52, 53, 3, 3, 54, 3, 55, 3

Offset: 1

Author

Antti Karttunen, Jul 11 2019

Keywords

• nonn

Comments

For all i, j:

A305801(i) = A305801(j) => a(i) = a(j),

a(i) = a(j) => A009191(i) = A009191(j) => A322980(i) = A322980(j).

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537

Crossrefs

Cf. A000005, A009191, A046642, A305801, A322980.

Cf. also A326202, A326203.

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; };
Aux326201(n) = if((n>1) && (1==gcd(n,numdiv(n))),0,n);
v326201 = rgs_transform(vector(up_to, n, Aux326201(n)));
A326201(n) = v326201[n];