A001470 -id:A001470 - cp's OEIS frontend

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

N. J. A. Sloane, Jan 15 2000

nonn

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

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.

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

Column k=9 of A008307.

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

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

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

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

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

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

A053502 Number of degree-n permutations of order dividing 12.

Original entry on oeis.org

1, 1, 2, 6, 24, 96, 576, 3312, 21456, 152784, 1237536, 9984096, 133494912, 1412107776, 16369357824, 206123325696, 2866280276736, 36809077162752, 592066290710016, 8800038127378944, 136876273991755776, 2197453620220010496, 37915306084793106432

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.

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

Column k=12 of A008307.

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

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

a[n_]:= a[n] = If[n<0, 0, If[n==0, 1, Sum[Product[n-i, {i, 1, j-1}]*a[n-j], {j, {1, 2, 3, 4, 6, 12}}]]]; Table[a[n], {n, 0, 25}] (* Jean-François Alcover, Apr 24 2014, after Alois P. Heinz *)
With[{m = 30}, CoefficientList[Series[Exp[x +x^2/2 +x^3/3 +x^4/4 +x^6/6 + x^12/12], {x, 0, m}], x]*Range[0, m]!] (* G. C. Greubel, May 15 2019 *)

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

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

E.g.f.: exp(x + x^2/2 + x^3/3 + x^4/4 + x^6/6 + x^12/12).

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).

A118931 Triangle, read by rows, where T(n,k) = n!/(k!(n-3k)!3^k) for n>=3k>=0.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 8, 1, 20, 1, 40, 40, 1, 70, 280, 1, 112, 1120, 1, 168, 3360, 2240, 1, 240, 8400, 22400, 1, 330, 18480, 123200, 1, 440, 36960, 492800, 246400, 1, 572, 68640, 1601600, 3203200, 1, 728, 120120, 4484480, 22422400, 1, 910, 200200, 11211200, 112112000, 44844800

Offset: 0

Paul D. Hanna, May 06 2006

Row n contains 1+floor(n/3) terms. Row sums yield A001470. Given column vector V = A118932, then V is invariant under matrix product T*V = V, or, A118932(n) = Sum_{k=0..n} T(n,k)*A118932(k). Given C = Pascal's triangle and T = this triangle, then matrix product M = C^-1*T yields M(3n,n) = (3*n)!/(n!*3^n), 0 otherwise (cf. A100861 formula due to Paul Barry).

			Triangle T begins:
  1;
  1;
  1;
  1,   2;
  1,   8;
  1,  20;
  1,  40,    40;
  1,  70,   280;
  1, 112,  1120;
  1, 168,  3360,   2240;
  1, 240,  8400,  22400;
  1, 330, 18480, 123200;
  1, 440, 36960, 492800, 246400;

G. C. Greubel, Rows n = 0..150 of the triangle, flattened

Cf. A001470 (row sums), A118932 (invariant vector).

Variants: A100861, A118933.

F:= Factorial;
[n lt 3*k select 0 else F(n)/(3^k*F(k)*F(n-3*k)): k in [0..Floor(n/3)], n in [0..20]]; // G. C. Greubel, Mar 07 2021

Trow := n -> seq(n!/(j!*(n - 3*j)!*(3^j)), j = 0..n/3):
seq(Trow(n), n = 0..14); # Peter Luschny, Jun 06 2021

T[n_,k_]:= If[n<3*k, 0, n!/(3^k*k!*(n-3*k)!)];
Table[T[n,k], {n,0,20}, {k,0,Floor[n/3]}]//Flatten (* G. C. Greubel, Mar 07 2021 *)

T(n,k)=if(n<3*k,0,n!/(k!*(n-3*k)!*3^k))

f=factorial;
flatten([[0 if n<3*k else f(n)/(3^k*f(k)*f(n-3*k)) for k in [0..n/3]] for n in [0..20]]) # G. C. Greubel, Mar 07 2021

E.g.f.: A(x,y) = exp(x + y*x^3/3).

A121357 Number of different, not necessarily connected, labeled trivalent diagrams of size n.

Original entry on oeis.org

1, 1, 2, 12, 90, 546, 6156, 81432, 942012, 15114780, 294765336, 5069224656, 108842183352, 2770895886552, 64609245619920, 1742542175582496, 55074355772360976, 1626315165597840912, 53331321825434963232

Offset: 0

Samuel A. Vidal, Jul 23 2006

nonn

Equivalently, the number of PSL_2(ZZ) actions on a finite labeled set of size n.

Also the number of (r,s) pair of permutations in S_n for which r is involutive, i.e., r^2 = id and s is of weak order three, i.e., s^3 = id.

S. A. Vidal, Sur la Classification et le Denombrement des Sous-groupes du Groupe Modulaire et de leurs Classes de Conjugaison, (in French), arXiv:math/0702223 [math.CO] 2006.

Unconnected version of A121355.
Labeled version of A121352.
Labeled, unconnected version of A121350.
Cf. also A005133, A121356.

N := 100 : exs2:=sort(convert(taylor(exp(t+t^2/2),t,N+1),polynom),t, ascending) : exs3:=sort(convert(taylor(exp(t+t^3/3),t,N+1),polynom),t, ascending) : exs23:=sort(add(op(n+1,exs2)*op(n+1,exs3)/(t^n/ n!),n=0..N),t, ascending) : sort(add(op(n+1,exs23)*n!,n=0..N),t, ascending);

m = 18; exs2 = Series[Exp[t + t^2/2], {t, 0, m + 1}] // Normal; exs3 = Series[Exp[t + t^3/3], {t, 0, m + 1}] // Normal; exs23 = Sum[exs2[[n + 1]]*exs3[[n + 1]]/(t^n/n!), {n, 0, m}]; CoefficientList[ Sum[exs23[[n + 1]]*n!, {n, 0, m}], t] (* Jean-François Alcover, Dec 05 2012, translated from Samuel Vidal's Maple program *)

N=19; x='x+O('x^N);
Vec(serconvol(serlaplace(exp(x+x^2/2)), serlaplace(exp(x+x^3/3)))) \\ Gheorghe Coserea, May 10 2017

If A(z) = g.f. of a(n) and B(z) = g.f. of A121355 then A(z) = exp(B(z)).
Six-term linear recurrence: (n^3 + 12*n^2 + 47*n + 61)*a(n + 6) = (29040 + 239224*n^2 + 127628*n + 20715*n^6 + 252267*n^3 + 166304*n^4 + 71889*n^5 + 33*n^9 + 3943*n^7 + 476*n^8 + n^10)*a(n) + (441*n^4 + 3*n^6 + 2160 + 57*n^5 + 4572*n + 3948*n^2 + 1779*n^3)*a(n + 1) + (34920 + 61314*n + 45886*n^2 + 18989*n^3 + 4697*n^4 + 695*n^5 + 57*n^6 + 2*n^7)*a(n + 2) + (19640 + 79*n^5 + 3*n^6 + 861*n^4 + 27598*n + 16084*n^2 + 4975*n^3)*a(n + 3) + (17*n^3 + 425 + n^4 + 350*n + 113*n^2)*a(n + 4) + (1 + 20*n + 9*n^2 + n^3)*a(n + 5) with n = 0, 1, ...
a(n) = A000085(n) * A001470(n). - Mark van Hoeij, May 13 2013

A053498 Number of degree-n permutations of order dividing 8.

Original entry on oeis.org

1, 1, 2, 4, 16, 56, 256, 1072, 11264, 78976, 672256, 4653056, 49810432, 433429504, 4448608256, 39221579776, 607251736576, 7244686764032, 101611422797824, 1170362064019456, 19281174853615616, 261583327556386816, 4084459360167657472, 54366023748591386624

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.

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

Column k=8 of A008307.

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

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

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

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

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

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

A053504 Number of degree-n permutations of order dividing 24.

Original entry on oeis.org

1, 1, 2, 6, 24, 96, 576, 3312, 26496, 198144, 1691136, 14973696, 193370112, 2034809856, 25087186944, 313539434496, 4421478721536, 58307347556352, 915011420737536, 13553664911437824, 240637745416421376, 3965015057937924096

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.

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

Column k=24 of A008307.

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

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, 2, 3, 4, 6, 8, 12, 24])))
    end:
seq(a(n), n=0..25);  # Alois P. Heinz, Jan 25 2014

a[n_]:= a[n] = If[n<0, 0, If[n==0, 1, Sum[Product[n-i, {i, 1, j-1}]*a[n-j], {j, {1, 2, 3, 4, 6, 8, 12, 24}}]]]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Mar 19 2014, after Alois P. Heinz *)
With[{nn=30},CoefficientList[Series[Exp[Total[x^#/#&/@Divisors[24]]],{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, Mar 05 2016 *)

N=30; x='x+O('x^N);
Vec(serlaplace(exp(sumdiv(24, d, x^d/d)))) \\ Gheorghe Coserea, May 11 2017

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

E.g.f.: exp(x + x^2/2 + x^3/3 + x^4/4 + x^6/6 + x^8/8 + x^12/12 + x^24/24).

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

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A053502 Number of degree-n permutations of order dividing 12.

Views

Author

Keywords

References

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

A118931 Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A121357 Number of different, not necessarily connected, labeled trivalent diagrams of size n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A053498 Number of degree-n permutations of order dividing 8.

Views

Author

Keywords

References

Links

Crossrefs

A118931 Triangle, read by rows, where T(n,k) = n!/(k!(n-3k)!3^k) for n>=3k>=0.