cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A092238 Number of ways to write the permutation n,n-1,...,1 of 1,2,...,n as a product of n(n-1)/2 transpositions, where each transposition of 1,2,...,n occurs exactly once.

This page as a plain text file.
%I A092238 #6 Jul 12 2017 19:48:24
%S A092238 1,1,1,2,64,59712,3580519776
%N A092238 Number of ways to write the permutation n,n-1,...,1 of 1,2,...,n as a product of n(n-1)/2 transpositions, where each transposition of 1,2,...,n occurs exactly once.
%C A092238 If we impose the additional condition on the product t_1 t_2 ... of transpositions that the number of inversions increases by one each time we multiply by a t_i, then the number of ways is given by A005118.
%e A092238 a(3)=2 because 321 = (1,2)(1,3)(2,3) = (2,3)(1,3)(1,2).
%Y A092238 Cf. A005118.
%K A092238 more,nonn
%O A092238 0,4
%A A092238 _Richard Stanley_, Feb 19 2004
%E A092238 a(0)=1 prepended and a(6) added by _Alois P. Heinz_, Jul 12 2017