

A371099


a(n) = gcd(36*n+9, A276086(36*n+9)), where A276086 is the primorial base expfunction.


2



3, 15, 3, 3, 3, 21, 75, 3, 33, 3, 3, 15, 3, 3, 3, 3, 15, 3, 3, 231, 3, 15, 3, 3, 3, 3, 105, 3, 3, 3, 363, 75, 3, 21, 3, 3, 15, 3, 3, 3, 21, 165, 3, 3, 3, 3, 15, 3, 3, 3, 3, 15, 33, 3, 21, 3, 75, 3, 3, 3, 3, 735, 3, 33, 3, 3, 15, 3, 273, 3, 3, 15, 3, 3, 33, 21, 15, 3, 3, 3, 3, 975, 3, 3, 3, 33, 15, 3, 3, 21, 3, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

All terms are multiples of 3, with A007949(a(n)) = 1 for all n.


LINKS



FORMULA



MATHEMATICA

f[x_] := Block[{m, i, n = x, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m]; Array[GCD[#, f[#]] &[36 # + 9] &, 100, 0] (* Michael De Vlieger, Mar 10 2024, after JeanFrançois Alcover at A276086 *)


PROG

(PARI)
A324198(n) = { my(m=1, p=2, orgn=n); while(n, m *= (p^min(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m); };


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



