A329351 Lexicographically earliest infinite sequence such that a(i) = a(j) => A329350(i) = A329350(j) for all i, j.

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

Offset

1,2

Comments

Restricted growth sequence transform of A329350.

For all i, j:

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

a(i) = a(j) => A069359(i) = A069359(j).

Links

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

Prog

(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; };
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A329350(n) = { my(m=1); fordiv(n, d, if(isprime(n/d), m *= A276086(d))); (m); };
v329351 = rgs_transform(vector(up_to, n, A329350(n)));
A329351(n) = v329351[n];

Crossrefs

Cf. A069359, A305800, A329350.

Cf. also A329353, A329381.

Sequence in context: A300233 A353523 A293217 * A319709 A293226 A373151

Adjacent sequences: A329348 A329349 A329350 * A329352 A329353 A329354

Keyword

nonn

Author

Antti Karttunen, Nov 12 2019

Status

approved