A344025 Lexicographically earliest infinite sequence such that a(i) = a(j) => A003415(i) = A003415(j) and A003557(i) = A003557(j), for all i, j >= 1.

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

Offset

1,2

Comments

Restricted growth sequence transform of the ordered pair [A003415(n), A003557(n)], where A003415(n) is the arithmetic derivative of n, and A003557(n) is n divided by its largest squarefree divisor.

For all i, j:

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

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

a(i) = a(j) => A369051(i) = A369051(j) => A085731(i) = A085731(j).

Where "parent" can be any of the sequences A351236, A351260, A353520, A353521, A369050, for example.

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; };
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
Aux344025(n) = [A003415(n), A003557(n)];
v344025 = rgs_transform(vector(up_to, n, Aux344025(n)));
A344025(n) = v344025[n];

Crossrefs

Cf. A003415, A003557, A085731, A342001, A369051.

Cf. also A305800, A351236, A351260, A353520, A353521, A369050, and also A353523.

Sequence in context: A300835 A369051 A369046 * A379240 A351236 A373268

Adjacent sequences: A344022 A344023 A344024 * A344026 A344027 A344028

Keyword

nonn

Author

Antti Karttunen, May 07 2021

Status

approved