A053499 Number of degree-n permutations of order dividing 9.

1, 1, 1, 3, 9, 21, 81, 351, 1233, 46089, 434241, 2359611, 27387801, 264333213, 1722161169, 16514298711, 163094452641, 1216239520401, 50883607918593, 866931703203699, 8473720481213481, 166915156382509221, 2699805625227141201, 28818706120636531023, 439756550972215638129, 6766483260087819272601, 77096822666547068590401, 3568144263578808757678251

Offset: 0

Author

N. J. A. Sloane, Jan 15 2000

Keywords

• nonn

Comments

Differs from A218003 first at n=27. - Alois P. Heinz, Jan 25 2014

References

• R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.10.

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..200
• L. Moser and M. Wyman, On solutions of x^d = 1 in symmetric groups, Canad. J. Math., 7 (1955), 159-168.

Crossrefs

Cf. A000085, A001470, A001472, A053495-A053505, A005388, A261429.

Column k=9 of A008307.

Programs

Magma

m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!( Exp(x + x^3/3 + x^9/9) )); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, May 15 2019

Maple

a:= proc(n) option remember; `if`(n<0, 0, `if`(n=0, 1,
       add(mul(n-i, i=1..j-1)*a(n-j), j=[1, 3, 9])))
    end:
seq(a(n), n=0..25);  # Alois P. Heinz, Feb 14 2013

Mathematica

CoefficientList[Series[Exp[x+x^3/3+x^9/9], {x, 0, 30}], x]*Range[0, 30]! (* Jean-François Alcover, Mar 24 2014 *)

PARI

my(x='x+O('x^30)); Vec(serlaplace( exp(x + x^3/3 + x^9/9) )) \\ G. C. Greubel, May 15 2019

Sage

m = 30; T = taylor(exp(x + x^3/3 + x^9/9), x, 0, m); [factorial(n)*T.coefficient(x, n) for n in (0..m)] # G. C. Greubel, May 15 2019

Formula

E.g.f.: exp(x + x^3/3 + x^9/9).