OFFSET
1,4
LINKS
Saeed Zakeri, Cyclic Permutations: Degrees and Combinatorial Types, arXiv:1909.03300 [math.DS], 2019. See Table 1 p. 8.
FORMULA
a(n) = (1/n)*Sum_{d|n} moebius(d)*phi(d)*d^(n/d)*(n/d)!.
a(n) = n*A064852(n). - Andrew Howroyd, May 07 2021
MATHEMATICA
Table[(1/n) DivisorSum[n, MoebiusMu[#] EulerPhi[#] #^(n/#)*(n/#)! &], {n, 24}] (* Michael De Vlieger, May 07 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, moebius(d)*eulerphi(d)*d^(n/d)*(n/d)!)/n;
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, Sep 10 2019
EXTENSIONS
a(1)=1 prepended by Andrew Howroyd, May 07 2021
STATUS
approved