OFFSET
1,6
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
MATHEMATICA
a[n_] := (dd = Divisors[n]; GCD[Times @@ dd, Times @@ Complement[Range[n], dd]]); Array[a, 59]
a[n_] := GCD[(p = n^(DivisorSigma[0, n]/2)), n!/p]; Array[a, 60] (* Amiram Eldar, Jun 26 2022 *)
PROG
(Haskell)
a072046 n = gcd (a007955 n) (a055067 n)
-- Reinhard Zumkeller, Feb 06 2012
(Python)
from math import isqrt, gcd, factorial
from sympy import divisor_count
def A072046(n): return gcd(p:=isqrt(n)**c if (c:=divisor_count(n)) & 1 else n**(c//2), factorial(n)//p) # Chai Wah Wu, Jun 25 2022
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
Reinhard Zumkeller, Jul 29 2002
STATUS
approved