A346095 a(n) = gcd(A324886(n), A064989(A324886(n))).

1, 1, 1, 1, 1, 1, 1, 3, 5, 1, 1, 1, 1, 1, 1, 9, 1, 25, 1, 1, 1, 1, 1, 5, 49, 1, 1, 1, 1, 7, 1, 1, 1, 1, 121, 625, 1, 1, 1, 7, 1, 11, 1, 1, 7, 1, 1, 5, 143, 2401, 1, 1, 1, 1, 169, 1, 1, 1, 1, 343, 1, 1, 1331, 1, 17, 1, 1, 1, 1, 161051, 1, 175, 1, 1, 41503, 1, 169, 1, 1, 49, 35, 1, 1, 121, 19, 1, 1, 1, 1, 49, 24137569

Offset: 1

Author

Antti Karttunen, Jul 07 2021

Keywords

• nonn

Links

• 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

Crossrefs

Cf. A006530, A324886, A329044, A330749, A346096, A346097.

Programs

PARI

A330749(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); gcd(n, factorback(f)); };
A346095(n) = A330749(A324886(n)); \\ Rest of program given in A324886.

Formula

a(n) = A330749(A324886(n)) = gcd(A324886(n), A329044(n)) = gcd(A324886(n), A064989(A324886(n))).

a(n) = A324886(n) / A346096(n).

a(n) = A329044(n) / A346097(n).

a(n) mod A006530(n) > 0, for all n > 1.