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.

Showing 1-3 of 3 results.

A145222 a(n) is the number of odd permutations (of an n-set) with exactly 1 fixed point.

Original entry on oeis.org

0, 0, 3, 0, 30, 120, 945, 7392, 66780, 667440, 7342335, 88107360, 1145396538, 16035550440, 240533257965, 3848532125760, 65425046139960, 1177650830516832, 22375365779822715, 447507315596450880, 9397653627525472470, 206748379805560389720, 4755212735527888968873
Offset: 1

Views

Author

Abdullahi Umar, Oct 09 2008

Keywords

Examples

			a(3) = 3 because there are exactly 3 odd permutations (of a 3-set) having 1 fixed point, namely: (12), (13), (23).

Links

Crossrefs

Cf. A000387 (odd permutations with no fixed points), A145219 (even permutations with exactly 1 fixed point), A145223 (odd permutations with exactly 2 fixed points).

Programs

  • Mathematica
    A145222[n_] := n*Subfactorial[n - 3]*Binomial[n - 1, 2]; Array[A145222, 25] (* Paolo Xausa, Jan 31 2025 *)
  • PARI
    x = 'x + O('x^30); Vec(serlaplace(((x^3)*exp(-x))/(2*(1-x)))) \\ Michel Marcus, Apr 04 2016

Formula

a(n) = A145225(n,1) = n*A000387(n-1), (n > 0).
E.g.f.: x^3*exp(-x)/(2*(1-x)).
D-finite with recurrence (-n+3)*a(n) +n*(n-4)*a(n-1) +n*(n-1)*a(n-2)=0. - R. J. Mathar, Jul 06 2023

Extensions

More terms from Alois P. Heinz, Apr 04 2016

A145220 a(n) is the number of even permutations (of an n-set) with exactly 2 fixed points.

Original entry on oeis.org

1, 0, 0, 20, 45, 504, 3640, 33480, 333585, 3671360, 44053416, 572698620, 8017774765, 120266629560, 1924266062160, 32712523070864, 588825415257345, 11187682889912640, 223753657798223920, 4698826813762738020, 103374189902780192781, 2377606367763944486840
Offset: 2

Views

Author

Abdullahi Umar, Oct 09 2008

Keywords

Examples

			a(5) = 20 because there are exactly 20 even permutations (of a 5-set) having 2 fixed points, namely: (123), (132), (124), (142), (125), (152), (134), (143), (135), (153), (145), (154), (234), (243), (235), (253), (245), (254), (345), (354).

Links

Crossrefs

Cf. A003221, A145219, A145223.

Programs

  • PARI
    x = 'x + O('x^30); Vec(serlaplace((x^2*(1-x^2/2) * exp(-x))/(2*(1-x)))) \\ Michel Marcus, Apr 04 2016

Formula

a(n) = (n(n-1)/2)*A003221(n-2), (n > 1).
E.g.f.: (x^2*(1-x^2/2) * exp(-x))/(2*(1-x)).
D-finite with recurrence -(n-5)*(n-2)^2*a(n) +n*(n-3)*(n^2-7*n+8)*a(n-1) +n*(n-4)*(n-1)^2*a(n-2)=0. - R. J. Mathar, Jul 06 2023

Extensions

More terms from Alois P. Heinz, Nov 19 2013

A145224 Triangle read by rows: T(n,k) is the number of even permutations (of an n-set) with exactly k fixed points.

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 2, 0, 0, 1, 3, 8, 0, 0, 1, 24, 15, 20, 0, 0, 1, 130, 144, 45, 40, 0, 0, 1, 930, 910, 504, 105, 70, 0, 0, 1, 7413, 7440, 3640, 1344, 210, 112, 0, 0, 1, 66752, 66717, 33480, 10920, 3024, 378, 168, 0, 0, 1
Offset: 0

Views

Author

Abdullahi Umar, Oct 09 2008

Keywords

Examples

			Triangle starts:
   1;
   0,  1;
   0,  0,  1;
   2,  0,  0, 1;
   3,  8,  0, 0, 1;
  24, 15, 20, 0, 0, 1;
  ...

Links

Crossrefs

Row sums give A001710.
Columns k=0..2 are A003221, A145219, A145220.
Cf. A008290, A055137.

Formula

T(n,k) = C(n,k)*A003221(n-k).
E.g.f.: (x^k(1-x^2/2) e^(-x))/k!(1-x).
T(n,k) + A145225(n,k) = A008290(n,k). - R. J. Mathar, Jul 06 2023
T(n,k) = (A008290(n,k) + A055137(n,k))/2. - Julian Hatfield Iacoponi, Aug 08 2024
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.