|
%I #5 Mar 02 2020 12:28:15
%S 1,111,4357,150801,4654469,134049203,3729595473,102656565841,
%T 2828539643998,78576462334232,2212108223706338,63356175294304198,
%U 1851016172004724086,55265191691761995338,1688128671403459821842,52796230233728968111746,1691419149055825399281421
%N Number of entries in the tenth cycles of all permutations of [n] when cycles are ordered by increasing lengths.
%H Alois P. Heinz, <a href="/A332914/b332914.txt">Table of n, a(n) for n = 10..450</a>
%H Andrew V. Sills, <a href="https://arxiv.org/abs/1912.05306">Integer Partitions Probability Distributions</a>, arXiv:1912.05306 [math.CO], 2019.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%p b:= proc(n, i, t) option remember; `if`(n=0, [1, 0], `if`(i>n, 0,
%p add((p-> p+`if`(t>0 and t-j<1, [0, p[1]*i], 0))((i-1)!^j*
%p b(n-i*j, i+1, max(0, t-j))/j!*combinat[multinomial]
%p (n, i$j, n-i*j)), j=0..n/i)))
%p end:
%p a:= n-> b(n, 1, 10)[2]:
%p seq(a(n), n=10..26);
%Y Column k=10 of A322383.
%K nonn
%O 10,2
%A _Alois P. Heinz_, Mar 02 2020
|
