OFFSET
0,3
COMMENTS
Dirichlet convolution of phi(n) and n! (n >= 1). - Richard L. Ollerton, May 09 2021
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..449
FORMULA
a(n) = Sum_{i=1..n} gcd(n,i)!. - Ridouane Oudra, Nov 13 2019
MAPLE
MATHEMATICA
a[0] = 0; a[n_] := DivisorSum[n, EulerPhi[#] * (n/#)! &]; Array[a, 23, 0] (* Amiram Eldar, May 24 2021 *)
PROG
(PARI) a(n) = if (n>0, sumdiv(n, d, eulerphi(d)*(n/d)!), 0); \\ Michel Marcus, Aug 28 2019
(Magma) [0] cat [&+[EulerPhi(d)*Factorial(n div d):d in Divisors(n)]:n in [1..22]]; // Marius A. Burtea, Nov 13 2019
(Magma) [0] cat [&+[Factorial(Gcd(n, i)):i in [1..n]]:n in [1..22]]; // Marius A. Burtea, Nov 13 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Aug 27 2019
STATUS
approved