login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325956 Number of cyclic permutations of [n] with symmetry order s=1. 0
1, 0, 0, 4, 20, 108, 714, 4992, 40284, 362480, 3628790, 39912648, 479001588, 6226974684, 87178287120, 1307673722880, 20922789887984, 355687417715904, 6402373705727982, 121645100223034480, 2432902008175589664, 51090942167993548700, 1124000727777607679978, 25852016738803204991232 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A321574 A225621 A020084 * A026127 A222205 A262394
KEYWORD
nonn
AUTHOR
Michel Marcus, Sep 10 2019
EXTENSIONS
a(1)=1 prepended by Andrew Howroyd, May 07 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)