A331290 a(n) = gcd(A001222(n), A329348(n)).

1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 4, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 4, 2, 2, 1, 1, 1, 2, 3, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 1, 2, 1, 2, 2, 4, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1, 4, 1

Offset: 1

Author

Antti Karttunen, Jan 15 2020

Keywords

• nonn
• less

Comments

Records occur at n = 1, 4, 36, 112, 352, 1088, 2016, 2688, 8064, 63360, ...

Links

• Antti Karttunen, Table of n, a(n) 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

Crossrefs

Cf. A001222, A002110, A117366, A329348, A331188, A331289, A331291.

Cf. also A329618, A329621.

Programs

PARI

A002110(n) = prod(i=1, n, prime(i));
A331290(n) = if(1==n, 1, my(f=factor(n), p=nextprime(1+vecmax(f[, 1]))); gcd((prod(i=1, #f~, A002110(primepi(f[i, 1]))^(f[i, 2]-(#f~==i)))%p),bigomega(n)));

Formula

a(n) = gcd(A001222(n), A329348(n)) = gcd(A001222(n), A331188(n) mod A117366(n)).

a(n) = gcd(A001222(n), A331289(n)).