A373980 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = [A003415(n), A085731(n), A181819(n), A373247(n)], for all i, j >= 1.

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

Offset

1,2

Comments

Restricted growth sequence transform of the quadruple [A003415(n), A085731(n), A181819(n), A373247(n)].

For all i, j >= 1:

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

a(i) = a(j) => A300249(i) = A300249(j) => A101296(i) = A101296(j),

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

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

Links

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

Prog

(PARI)
up_to = 100000;
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]));
A181819(n) = factorback(apply(e->prime(e), (factor(n)[, 2])));
Aux373980(n) = { my(d=A003415(n), s=A181819(n)); [d, s, gcd(n, d), n%s]; };
v373980 = rgs_transform(vector(up_to, n, Aux373980(n)));
A373980(n) = v373980[n];

Crossrefs

Cf. A003415, A085731, A181819, A373247.

Cf. A101296, A300249, A305801, A369051, A373250.

Differs from A353520 and A361021 first at n=130, where a(130) = 82, while A353520(130) = A361021(130) = 96.

Sequence in context: A373981 A353520 A361021 * A322973 A305890 A305801

Adjacent sequences: A373977 A373978 A373979 * A373981 A373982 A373983

Keyword

nonn

Author

Antti Karttunen, Jun 24 2024

Status

approved