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”).
%I #15 Dec 15 2017 17:35:00
%S 1,24,2880,1008000,783820800,1150082841600,2856658246041600,
%T 11119228380868608000,64023737057280000000000,
%U 521514152055397400739840000,5799596870820600732828303360000
%N Number of ordered factorizations of the identity permutation in the symmetric group S_n into 2n-2 transpositions such that the factors generate S_n.
%D I. P. Goulden and D. M. Jackson, Transitive factorizations into transpositions and holomorphic mappings on the sphere, Proc. AMS., 125 (1997), 51-60.
%H Harry J. Smith, <a href="/A060902/b060902.txt">Table of n, a(n) for n=2,...,100</a>
%H I. P. Goulden and D. M. Jackson, <a href="http://dx.doi.org/10.1090/S0002-9939-97-03880-X">Transitive factorizations into transpositions and holomorphic mappings on the sphere</a>, Proc. AMS., 125 (1997), 51-60.
%F a(n) = (2n-2)! * n^(n-3).
%e a(2) = 1 because the only such factorization is (12)(12) = 1
%o (PARI) { for (n=2, 100, write("b060902.txt", n, " ", (2*n - 2)! * n^(n - 3)); ) } \\ _Harry J. Smith_, Jul 14 2009
%K nonn,easy
%O 2,2
%A Ahmed Fares (ahmedfares(AT)my-deja.com), May 05 2001
%E More terms from _Jason Earls_, May 08 2001