cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A325956 Number of cyclic permutations of [n] with symmetry order s=1.

Original entry on oeis.org

1, 0, 0, 4, 20, 108, 714, 4992, 40284, 362480, 3628790, 39912648, 479001588, 6226974684, 87178287120, 1307673722880, 20922789887984, 355687417715904, 6402373705727982, 121645100223034480, 2432902008175589664, 51090942167993548700, 1124000727777607679978, 25852016738803204991232
Offset: 1

Views

Author

Michel Marcus, Sep 10 2019

Keywords

Crossrefs

Programs

  • Mathematica
    Table[(1/n) DivisorSum[n, MoebiusMu[#] EulerPhi[#] #^(n/#)*(n/#)! &], {n, 24}] (* Michael De Vlieger, May 07 2021 *)
  • PARI
    a(n) = sumdiv(n, d, moebius(d)*eulerphi(d)*d^(n/d)*(n/d)!)/n;

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

Extensions

a(1)=1 prepended by Andrew Howroyd, May 07 2021