A052501 -id:A052501 - cp's OEIS frontend

A053497 Number of degree-n permutations of order dividing 7.

1, 1, 1, 1, 1, 1, 1, 721, 5761, 25921, 86401, 237601, 570241, 1235521, 892045441, 13348249201, 106757164801, 604924594561, 2722120577281, 10344007402561, 34479959558401, 24928970490633601, 546446134633639681, 6281586217487489041, 50248618811434961281

Offset: 0

N. J. A. Sloane, Jan 15 2000

nonn

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

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.

Sequences with e.g.f. exp(x + x^m/m): A000079 (m=1), A000085 (m=2), A001470 (m=3), A118934 (m=4), A052501 (m=5), A293588 (m=6), this sequence (m=7).
Cf. A000085, A001470, A001472, A005388, A053495 - A053505, A261427.
Column k=7 of A008307.

R:=PowerSeriesRing(Rationals(), 31); Coefficients(R!(Laplace( Exp(x + x^7/7) ))); // G. C. Greubel, May 14 2019, Mar 07 2021

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, 7])))
    end:
seq(a(n), n=0..25); # Alois P. Heinz, Feb 14 2013

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

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

f=factorial; [sum(f(n)/(7^j*f(j)*f(n-7*j)) for j in (0..n/7)) for n in (0..30)] # G. C. Greubel, May 14 2019

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

a(n) = Sum_{k=0..floor(n/7)} n!/(7^k*k!*(n-7*k)!). - G. C. Greubel, Mar 07 2021

A061136 Number of degree-n odd permutations of order dividing 4.

Original entry on oeis.org

0, 0, 1, 3, 12, 40, 120, 336, 2128, 13392, 118800, 850960, 6004416, 38408448, 260321152, 1744135680, 17067141120, 167200393216, 1838196972288, 18345298804992, 181218866222080, 1673804042803200, 16992835499329536

Offset: 0

Vladeta Jovovic, Apr 14 2001

Lev Glebsky, Melany Licón, Luis Manuel Rivera, On the number of even roots of permutations, arXiv:1907.00548 [math.CO], 2019.

Cf. A000085, A001470, A001472, A052501, A053496 - A053505, A001189, A001471, A001473, A061121 - A061128, A000704, A061129 - A061132, A048099, A051695, A061133 - A061135, A001465, A061136 - A061140.

E.g.f.: 1/2*exp(x + 1/2*x^2 + 1/4*x^4) - 1/2*exp(x - 1/2*x^2 - 1/4*x^4).

A059593 Number of degree-n permutations of order exactly 5.

Original entry on oeis.org

0, 0, 0, 0, 0, 24, 144, 504, 1344, 3024, 78624, 809424, 4809024, 20787624, 72696624, 1961583624, 28478346624, 238536558624, 1425925698624, 6764765838624, 189239120970624, 3500701266525624, 37764092547420624, 288099608198025624

Offset: 0

Henry Bottomley, Jan 26 2001

nonn

The number of degree-n permutations of order exactly p (where p is prime) satisfies a(n) =a(n-1) + (1+a(n-p))*(n-1)!/(n-p)! with a(n)=0 if p>n. Also a(n) = Sum_{j=1 to floor[n/p]} n!/(j!*(n-p*j)!*(p^j)).

Alois P. Heinz, Table of n, a(n) for n = 0..300

Cf. A001471, A052501.

Column k=5 of A057731. - Alois P. Heinz, Feb 16 2013

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

a:= proc(n) option remember;
      `if`(n<5, 0, a(n-1)+(1+a(n-5))*(n-1)!/(n-5)!)
    end:
seq(a(n), n=1..30);  # Alois P. Heinz, Jan 25 2014

Table[Sum[n!/(j!*(n-5*j)!*5^j), {j,1,Floor[n/5]}], {n,0,25}] (* G. C. Greubel, May 14 2019 *)

{a(n) = sum(j=1,floor(n/5), n!/(j!*(n-5*j)!*5^j))}; \\ G. C. Greubel, May 14 2019

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

a(n) = a(n - 1) + (1 + a(n - 5))*(n - 1)(n - 2)(n - 3)(n - 4).
a(n) = Sum_{j=1..floor(n/5)} n!/(j!*(n - 5*j)!*(5^j)).
From G. C. Greubel, May 14 2019: (Start)
a(n) = A052501(n) - 1.
E.g.f.: exp(x + x^5/5) - exp(x). (End)

A061131 Number of degree-n even permutations of order dividing 8.

Original entry on oeis.org

1, 1, 1, 1, 4, 16, 136, 736, 4096, 20224, 326656, 2970496, 33826816, 291237376, 2129910784, 13607197696, 324498374656, 4599593353216, 52741679343616, 495632154179584, 7127212838772736, 94268828128854016, 2098358019107700736, 34030412427789500416

Offset: 0

Vladeta Jovovic, Apr 14 2001

J. Riordan, An Introduction to Combinatorial Analysis, John Wiley & Sons, Inc. New York, 1958 (Chap 4, Problem 22).

Alois P. Heinz, Table of n, a(n) for n = 0..502
Lev Glebsky, Melany Licón, Luis Manuel Rivera, On the number of even roots of permutations, arXiv:1907.00548 [math.CO], 2019.
T. Koda, M. Sato, Y. Tskegahara, 2-adic properties for the numbers of involutions in the alternating groups, J. Algebra Appl. 14 (2015), no. 4, 1550052 (21 pages).

Cf. A000085, A001470, A001472, A052501, A053496-A053505, A001189, A001471, A001473, A061121 - A061128, A000704, A061129-A061132, A048099, A051695, A061133-A061135.

my(x='x+O('x^30)); Vec(serlaplace(1/2*exp(x + 1/2*x^2 + 1/4*x^4 + 1/8*x^8) + 1/2*exp(x - 1/2*x^2 - 1/4*x^4 - 1/8*x^8))) \\ Michel Marcus, Jun 18 2019

E.g.f.: 1/2*exp(x + 1/2*x^2 + 1/4*x^4 + 1/8*x^8) + 1/2*exp(x - 1/2*x^2 - 1/4*x^4 - 1/8*x^8).

A061140 Number of degree-n odd permutations of order exactly 8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 5040, 45360, 226800, 831600, 9979200, 103783680, 2058376320, 23870246400, 265686220800, 2477893017600, 47031546481920, 656384611034880, 11972743148620800, 165640695384729600, 1969108505560627200

Offset: 0

Vladeta Jovovic, Apr 14 2001

Cf. A000085, A001470, A001472, A052501, A053496 - A053505, A001189, A001471, A001473, A061121 - A061128, A000704, A061129 - A061132, A048099, A051695, A061133 - A061135.

E.g.f.: - 1/2*exp(x + 1/2*x^2 + 1/4*x^4) + 1/2*exp(x - 1/2*x^2 - 1/4*x^4) + 1/2*exp(x + 1/2*x^2 + 1/4*x^4 + 1/8*x^8) - 1/2*exp(x - 1/2*x^2 - 1/4*x^4 - 1/8*x^8).

A061130 Number of degree-n even permutations of order dividing 6.

Original entry on oeis.org

1, 1, 1, 3, 12, 36, 126, 666, 6588, 44892, 237996, 2204676, 26370576, 219140208, 1720782792, 19941776856, 234038005776, 2243409386256, 23225205107088, 295070141019312, 4303459657780416, 55200265166477376, 660776587455193056

Offset: 0

Vladeta Jovovic, Apr 14 2001

Alois P. Heinz, Table of n, a(n) for n = 0..522
Lev Glebsky, Melany Licón, Luis Manuel Rivera, On the number of even roots of permutations, arXiv:1907.00548 [math.CO], 2019.

Cf. A000085, A001470, A001472, A052501, A053496 - A053505, A001189, A001471, A001473, A061121 - A061128, A000704, A061129 - A061132, A048099, A051695, A061133 - A061135.

E.g.f.: 1/2*exp(x + 1/2*x^2 + 1/3*x^3 + 1/6*x^6) + 1/2*exp(x - 1/2*x^2 + 1/3*x^3 - 1/6*x^6).

A118934 E.g.f.: exp(x + x^4/4).

Original entry on oeis.org

1, 1, 1, 1, 7, 31, 91, 211, 1681, 12097, 57961, 209881, 1874071, 17842111, 117303187, 575683291, 5691897121, 65641390081, 544238393041, 3362783785777, 36455473647271, 485442581801311, 4828464958268491, 35900587138847971, 423276450114749617, 6318491163509870401

Offset: 0

Paul D. Hanna, May 06 2006

nonn

Equals row sums of triangle A118933.

These are the telephone numbers T^(4)n of [Artioli et al., p. 7]. - _Eric M. Schmidt, Oct 12 2017

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Marcello Artioli, Giuseppe Dattoli, Silvia Licciardi, and Simonetta Pagnutti, Motzkin Numbers: an Operational Point of View, arXiv:1703.07262 [math.CO], 2017.
Vaclav Kotesovec, Graph - asymptotic (20000 terms)

Sequences with e.g.f. exp(x + x^m/m): A000079 (m=1), A000085 (m=2), A001470 (m=3), this sequence (m=4), A052501 (m=5), A293588 (m=6), A053497 (m=7).

Cf. A118933.

F:=Factorial; [(&+[F(n)/(4^j*F(j)*F(n-4*j)): j in [0..Floor(n/4)]]): n in [0..30]]; // G. C. Greubel, Mar 07 2021

With[{nn=30},CoefficientList[Series[Exp[x+x^4/4],{x,0,nn}],x]Range[0,nn]!] (* Harvey P. Dale, Jan 26 2013 *)
Table[Sum[n!/(4^k*k!*(n-4*k)!), {k,0,n/4}], {n,0,30}]

a(n)=if(n<0,0,if(n==0,1,a(n-1) + (n-1)*(n-2)*(n-3)*a(n-4)))

f=factorial; [sum(f(n)/(4^j*f(j)*f(n-4*j)) for j in (0..n/4)) for n in (0..30)] # G. C. Greubel, Mar 07 2021

a(n) = a(n-1) + (n-1)*(n-2)*(n-3)*a(n-4) for n>=4, with a(0)=a(1)=a(2)=a(3)=1.
a(n) ~ 1/2 * n^(3*n/4) * exp(n^(1/4)-3*n/4). - Vaclav Kotesovec, Feb 25 2014
a(n) = Sum_{k=0..floor(n/4)} n!/(4^k*k!*(n-4*k)!). - G. C. Greubel, Mar 07 2021

A061134 Number of degree-n even permutations of order exactly 8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 226800, 2494800, 29937600, 259459200, 1816214400, 10897286400, 301491590400, 4419628012800, 51209462304000, 482551041772800, 6979977625420800, 92611036249804800, 2078225819199129600

Offset: 1

Vladeta Jovovic, Apr 14 2001

Cf. A000085, A001470, A001472, A052501, A053496 - A053505, A001189, A001471, A001473, A061121 - A061128, A000704, A061129 - A061132, A048099, A051695, A061133 - A061135.

E.g.f.: - 1/2*exp(x + 1/2*x^2 + 1/4*x^4) - 1/2*exp(x - 1/2*x^2 - 1/4*x^4) + 1/2*exp(x + 1/2*x^2 + 1/4*x^4 + 1/8*x^8) + 1/2*exp(x - 1/2*x^2 - 1/4*x^4 - 1/8*x^8).

A061137 Number of degree-n odd permutations of order dividing 6.

Original entry on oeis.org

0, 0, 1, 3, 6, 30, 270, 1386, 6048, 46656, 387180, 2469060, 17204616, 158065128, 1903506696, 18887563800, 163657221120, 2095170230016, 30792968596368, 346564643468976, 3905503235814240, 58609511127871200, 866032039742528736

Offset: 0

Vladeta Jovovic, Apr 14 2001

Robert Israel, Table of n, a(n) for n = 0..522
Lev Glebsky, Melany Licón, Luis Manuel Rivera, On the number of even roots of permutations, arXiv:1907.00548 [math.CO], 2019.
Robert Israel, Recurrence for this sequence

Cf. A000085, A001470, A001472, A052501, A053496-A053505, A001189, A001471, A001473, A061121-A061128, A000704, A061129-A061132, A048099, A051695, A061133-A061135, A001465, A061136-A061140.

m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!( Exp(x + x^3/3)*Sinh(x^2/2 + x^6/6) )); [0,0] cat [Factorial(n+1)*b[n]: n in [1..m-2]]; // G. C. Greubel, Jul 02 2019

Egf:= exp(x + x^3/3)*sinh(x^2/2 + x^6/6):
S:= series(Egf,x,31):
seq(coeff(S,x,j)*j!,j=0..30); # Robert Israel, Jul 13 2018

With[{m=30}, CoefficientList[Series[Exp[x + x^3/3]*Sinh[x^2/2 + x^6/6], {x, 0, m}], x]*Range[0,m]!] (* Vincenzo Librandi, Jul 02 2019 *)

my(x='x+O('x^30)); concat([0,0], Vec(serlaplace( exp(x + x^3/3)*sinh(x^2/2 + x^6/6) ))) \\ G. C. Greubel, Jul 02 2019

m = 30; T = taylor(exp(x + x^3/3)*sinh(x^2/2 + x^6/6), x, 0, m); [factorial(n)*T.coefficient(x, n) for n in (0..m)] # G. C. Greubel, Jul 02 2019

E.g.f.: exp(x + x^3/3)*sinh(x^2/2 + x^6/6).

Linear recurrence of order 12 whose coefficients are polynomials in n of degree up to 15: see link. - Robert Israel, Jul 13 2018

A293588 E.g.f.: exp(x + x^6/6).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 121, 841, 3361, 10081, 25201, 55441, 6763681, 86692321, 605765161, 3027624601, 12109056961, 41169011521, 5063607974881, 94197184734241, 939457659787201, 6572292677455681, 36141156689382361, 166238526616664041, 20612479896229156321

Offset: 0

Eric M. Schmidt, Oct 12 2017

nonn

These are the telephone numbers T^(6)_n of [Artioli et al., p. 7].

Seiichi Manyama, Table of n, a(n) for n = 0..524
Marcello Artioli, Giuseppe Dattoli, Silvia Licciardi, and Simonetta Pagnutti, Motzkin Numbers: an Operational Point of View, arXiv:1703.07262 [math.CO], 2017.

Sequences with e.g.f. exp(x + x^m/m): A000079 (m=1), A000085 (m=2), A001470 (m=3), A118934 (m=4), A052501 (m=5), this sequence (m=6), A053497 (m=7).

Cf. A000085, A001470, A052501, A118934.

F:= Factorial;
[(&+[ F(n)/(6^k*F(k)*F(n-6*k)): k in [0..Floor(n/3)]]): n in [0..30]]; // G. C. Greubel, Mar 07 2021

With[{nn=30},CoefficientList[Series[Exp[x+x^6/6],{x,0,nn}],x] Range[ 0,nn]!] (* Harvey P. Dale, Dec 11 2017 *)
Table[Sum[n!/(6^k*k!*(n-6*k)!), {k, 0, n/6}], {n, 0, 30}] (* G. C. Greubel, Mar 07 2021 *)

my(x = 'x + O('x^30)); Vec(serlaplace(exp(x + x^6/6))) \\ Michel Marcus, Oct 13 2017

f=factorial;
[sum( f(n)/(6^k*f(k)*f(n-6*k)) for k in [0..n/3]) for n in [0..30]] # G. C. Greubel, Mar 07 2021

a(n) = a(n-1) + (n-1)!/(n-6)! * a(n-6).

a(n) = Sum_{j=0..floor(n/6)} n!/(6^j*j!*(n-6*j)!). - G. C. Greubel, Mar 07 2021

cp's OEIS Frontend

A053497 Number of degree-n permutations of order dividing 7.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A061136 Number of degree-n odd permutations of order dividing 4.

Views

Author

Keywords

Links

Crossrefs

Formula

A059593 Number of degree-n permutations of order exactly 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A061131 Number of degree-n even permutations of order dividing 8.

Views

Author

Keywords

References

Links

Crossrefs

Programs

PARI

Formula

A061140 Number of degree-n odd permutations of order exactly 8.

Views

Author

Keywords

Crossrefs

Formula

A061130 Number of degree-n even permutations of order dividing 6.

Views

Author

Keywords

Links

Crossrefs

Formula

A118934 E.g.f.: exp(x + x^4/4).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A061134 Number of degree-n even permutations of order exactly 8.

Views

Author

Keywords

Crossrefs

Formula

A061137 Number of degree-n odd permutations of order dividing 6.

Views