A285239 -id:A285239 - cp's OEIS frontend

A185105 Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.

1, 3, 1, 12, 5, 1, 60, 27, 8, 1, 360, 168, 59, 12, 1, 2520, 1200, 463, 119, 17, 1, 20160, 9720, 3978, 1177, 221, 23, 1, 181440, 88200, 37566, 12217, 2724, 382, 30, 1, 1814400, 887040, 388728, 135302, 34009, 5780, 622, 38, 1, 19958400, 9797760, 4385592, 1606446, 441383, 86029, 11378, 964, 47, 1

Offset: 1

Wouter Meeussen, Dec 26 2012

Row sums are n!*n = A001563(n) (see example).

For fixed k>=1, A185105(n,k) ~ n!*n/2^k. - Vaclav Kotesovec, Apr 25 2017

			The six permutations of n=3 in ordered cycle form are:
{ {1}, {2}, {3}    }
{ {1}, {2, 3}, {}  }
{ {1, 2}, {3}, {}  }
{ {1, 2, 3}, {}, {}}
{ {1, 3, 2}, {}, {}}
{ {1, 3}, {2}, {}  }
.
The lengths of the cycles in position k=1 sum to 12, those of the cycles in position k=2 sum to 5 and those of the cycles in position k=3 sum to 1.
Triangle begins:
       1;
       3,     1;
      12,     5,     1;
      60,    27,     8,     1;
     360,   168,    59,    12,    1;
    2520,  1200,   463,   119,   17,   1;
   20160,  9720,  3978,  1177,  221,  23,  1;
  181440, 88200, 37566, 12217, 2724, 382, 30, 1;
  ...

Alois P. Heinz, Rows n = 1..141, flattened
Wikipedia, Permutation

Columns k=1-10 give: A001710(n+1), A138772, A159324(n-1)/2 or A285231, A285232, A285233, A285234, A285235, A285236, A285237, A285238.
T(2n,n) gives A285239.
Cf. A000142, A001563, A270236, A284816, A285439.

b:= proc(n, i) option remember; expand(`if`(n=0, 1,
      add((p-> p+coeff(p, x, 0)*j*x^i)(b(n-j, i+1))*
       binomial(n-1, j-1)*(j-1)!, j=1..n)))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..n))(b(n, 1)):
seq(T(n), n=1..12);  # Alois P. Heinz, Apr 15 2017

Table[it = Join[RotateRight /@ ToCycles[#], Table[{}, {k}]] & /@ Permutations[Range[n]]; Tr[Length[Part[#, k]]& /@ it], {n, 7}, {k, n}]
(* Second program: *)
b[n_, i_] := b[n, i] = Expand[If[n==0, 1, Sum[Function[p, p + Coefficient[ p, x, 0]*j*x^i][b[n-j, i+1]]*Binomial[n-1, j-1]*(j-1)!, {j, 1, n}]]];
T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 1, n}]][b[n, 1]];
Array[T, 12] // Flatten (* Jean-François Alcover, May 30 2018, after Alois P. Heinz *)

More terms from Alois P. Heinz, Apr 15 2017

A332928 Number of entries in the n-th cycles of all permutations of [2n] when cycles are ordered by decreasing lengths.

Original entry on oeis.org

3, 21, 341, 9185, 343909, 16379573, 944353801, 63852563521, 4951434599465, 433032539982493, 42157340180935341, 4520992861815018433, 529496439697454958221, 67241241156753850936501, 9202393011905666532976785, 1350146007561231136610441985

Offset: 1

Alois P. Heinz, Mar 02 2020

nonn

Alois P. Heinz, Table of n, a(n) for n = 1..200
Wikipedia, Permutation

Cf. A187661, A285239, A322384.

b:= proc(n, i, t) option remember; `if`(n=0, [1, 0], `if`(i<1, 0,
      add((p-> p+`if`(t>0 and t-j<1, [0, p[1]*i], 0))((i-1)!^j*
        b(n-i*j, min(n-i*j, i-1), max(0, t-j))/j!*
        combinat[multinomial](n, i$j, n-i*j)), j=0..n/i)))
    end:
a:= n-> b(2*n$2, n)[2]:
seq(a(n), n=1..17);

multinomial[n_, k_List] := n!/Times @@ (k!);
b[n_, i_, t_] := b[n, i, t] = If[n == 0, {1, 0}, If[i < 1, {0, 0},
     Sum[Function[p, p+If[t>0 && t-j<1, {0, p[[1]]*i}, {0, 0}]][(i-1)!^j*
     b[n - i*j, Min[n - i*j, i - 1], Max[0, t - j]]/j!*
     multinomial[n, Append[Table[i, {j}], n - i*j]]], {j, 0, n/i}]]];
a[n_] := b[2n, 2n, n][[2]];
Array[a, 17] (* Jean-François Alcover, Apr 23 2021, after Alois P. Heinz *)

a(n) = A322384(2n,n).

a(n) ~ 2^(3*n-1) * c^(2*n) * n^(n - 1/2) / (sqrt(Pi*(c-1)) * (2*c-1)^n * exp(n)), where c = -LambertW(-1,-exp(-1/2)/2) = 1.7564312086261696769827376166... - Vaclav Kotesovec, Mar 10 2020

cp's OEIS Frontend

A185105 Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions