login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A332914
Number of entries in the tenth cycles of all permutations of [n] when cycles are ordered by increasing lengths.
2
1, 111, 4357, 150801, 4654469, 134049203, 3729595473, 102656565841, 2828539643998, 78576462334232, 2212108223706338, 63356175294304198, 1851016172004724086, 55265191691761995338, 1688128671403459821842, 52796230233728968111746, 1691419149055825399281421
OFFSET
10,2
LINKS
Andrew V. Sills, Integer Partitions Probability Distributions, arXiv:1912.05306 [math.CO], 2019.
Wikipedia, Permutation
MAPLE
b:= proc(n, i, t) option remember; `if`(n=0, [1, 0], `if`(i>n, 0,
add((p-> p+`if`(t>0 and t-j<1, [0, p[1]*i], 0))((i-1)!^j*
b(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(n, 1, 10)[2]:
seq(a(n), n=10..26);
CROSSREFS
Column k=10 of A322383.
Sequence in context: A332950 A302956 A232080 * A129051 A012039 A286117
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 02 2020
STATUS
approved