|
| |
|
|
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.
|
|
0
| | |
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| 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.
|
|
|
EXAMPLE
| a(3)=2 because 321 = (1,2)(1,3)(2,3) = (2,3)(1,3)(1,2).
|
|
|
CROSSREFS
| Sequence in context: A085535 A060613 A139772 * A003358 A041511 A156651
Adjacent sequences: A092235 A092236 A092237 * A092239 A092240 A092241
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| R. P. Stanley (rstan(AT)math.mit.edu), Feb 19 2004
|
| |
|
|
