|
|
A058250
|
|
GCD of n-th primorial number and its totient.
|
|
8
|
|
|
1, 1, 2, 2, 6, 30, 30, 30, 30, 330, 2310, 2310, 2310, 2310, 2310, 53130, 690690, 20030010, 20030010, 20030010, 20030010, 20030010, 20030010, 821230410, 821230410, 821230410, 821230410, 13960916970, 739928599410, 739928599410
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6) = gcd(30030,5760) = 30.
|
|
MAPLE
|
[seq(igcd(product(ithprime(k), k=1..m), product(ithprime(k)-1, k=1..m)), m=1..50)];
|
|
MATHEMATICA
|
GCD[#, EulerPhi[#]]&/@Rest[FoldList[Times, 1, Prime[Range[30]]]] (* Harvey P. Dale, Dec 19 2012 *)
Fold[Append[#1, {#1, #2, GCD[#1, #2]} & @@ {#4 #1, #2 (#4 - 1)} & @@ Append[#1[[-1]], #2]] &, {{1, 1, 1}}, Prime@ Range[29]][[All, -1]] (* Michael De Vlieger, Apr 25 2019 *)
|
|
PROG
|
(PARI) a(n) = my(pr=prod(k=1, n, prime(k))); gcd(pr, eulerphi(pr)); \\ Michel Marcus, Apr 13 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|