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

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, 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, 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

Offset

1,2

Comments

Restricted growth sequence transform of A322312.

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; };
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); };
v322313 = rgs_transform(vector(up_to, n, A322312(n)));
A322313(n) = v322313[n];

Crossrefs

Cf. A322312, A322315.

Sequence in context: A317746 A364449 A228179 * A322315 A375038 A319338

Adjacent sequences: A322310 A322311 A322312 * A322314 A322315 A322316

Keyword

nonn

Author

Antti Karttunen, Dec 03 2018

Status

approved