A345942 a(n) = n / gcd(n, A329044(n)).

1, 1, 1, 1, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 3, 4, 1, 2, 1, 4, 3, 2, 1, 8, 1, 2, 9, 4, 1, 6, 1, 16, 3, 2, 5, 4, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 7, 2, 3, 4, 1, 6, 5, 8, 3, 2, 1, 12, 1, 2, 9, 16, 5, 6, 1, 4, 3, 10, 1, 8, 1, 2, 3, 4, 7, 6, 1, 16, 27, 2, 1, 12, 5, 2, 3, 8, 1, 18, 7, 4, 3, 2, 5, 32, 1, 2, 9, 20, 1, 6

Offset

1,6

Links

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

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to primorial base

Index entries for sequences related to primorial numbers

Formula

a(n) = n / A345941(n).

Prog

(PARI) A345942(n) = (n/gcd(n, A329044(n))); \\ Rest of program given in A329044.

Crossrefs

Cf. A108951, A324886, A329044, A345941, A345943.

Sequence in context: A201199 A318459 A300823 * A175702 A303781 A216377

Adjacent sequences: A345939 A345940 A345941 * A345943 A345944 A345945

Keyword

nonn

Author

Antti Karttunen, Jul 03 2021

Status

approved