How manyare there with
?
Thanks in advance.
First this is true forso let us forget about this one.
Next, writewhere
are disjoint cycles.
We have that the order ofis the lowest common multiple of the lengths of each
.
Therefore, we require forto be a product of disjoint 2-cycles.
The # of transpositions is:
The # of double disjoint transpositions is:
The # of triple disjoint transpositiong is:.
And so on ...
Add them up to get your answer.

there's a combinatorial way of looking at this problem: letand
now let
and
if
then there are
possibilities for
![]()
ifthen we must have
because
so there will be
possibilities for
in this case. thus we have this recurrence relation:
with initial conditionsthere are only non-closed form expressions for
and one of them was given by ThePerfectHacker:
for more insight about the mysterious sequencesee here.
Edit: simplifying ThePerfectHacker's formula gives you this better looking one:![]()