OFFSET
1,1
COMMENTS
a(n) mod n = 0 for n: 1, 2, 6, 30, 78, 330, 390, 870, 1410, 3198, ...
EXAMPLE
a(4) = 42 because the divisors of 4 are: 1, 2 and 4; and prime(1) * prime(2) * prime(4) = 2 * 3 * 7 = 42.
MATHEMATICA
Table[Times@@(Prime[#]&/@Divisors[n]), {n, 50}] (* Harvey P. Dale, Jun 16 2017 *)
PROG
(Magma) [(&*[NthPrime(d): d in Divisors(n)]): n in [1..100]]
(PARI) a(n) = my(d=divisors(n)); prod(i=1, #d, prime(d[i])) \\ Felix Fröhlich, Aug 05 2016
(Perl) use ntheory ":all"; sub a275700 { vecprod(map { nth_prime($_) } divisors($_[0])); } # Dana Jacobsen, Aug 09 2016
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Aug 05 2016
STATUS
approved