A366373 a(n) = gcd(n, A332214(n)), where A332214 is the Mersenne-prime fixing variant of permutation A163511.

1, 1, 2, 3, 4, 1, 6, 7, 8, 9, 2, 1, 12, 1, 14, 5, 16, 1, 18, 1, 4, 21, 2, 1, 24, 1, 2, 1, 28, 1, 10, 31, 32, 3, 2, 7, 36, 1, 2, 1, 8, 1, 42, 1, 4, 15, 2, 1, 48, 7, 2, 1, 4, 1, 2, 5, 56, 3, 2, 1, 20, 1, 62, 1, 64, 1, 6, 1, 4, 3, 14, 1, 72, 1, 2, 25, 4, 1, 2, 1, 16, 27, 2, 1, 84, 5, 2, 1, 8, 1, 30, 7, 4, 93, 2, 1, 96

Offset: 0

Author

Antti Karttunen, Oct 08 2023

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..8191

Crossrefs

Cf. A332214, A366372, A366374, A366375, A366376.

Cf. also A364254, A364255, A366283.

Programs

PARI

A366373(n) = gcd(n,A332214(n));

Formula

a(n) = gcd(n, A366372(n)) = gcd(A332214(n), A366372(n)).

For n >= 1, a(n) = n / A366374(n)

a(n) = A332214(n) / A366375(n).