login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014982 Number of "coherent" reduced decompositions for the longest permutation n n-1 n-2 ... 3 2 1 in the symmetric group on n letters. 0
1, 1, 2, 12, 272, 21666 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

For definition of "coherent", see L J. Billera and B. Sturmfels, Iterated fiber polytopes, Mathematika, 41 (1994), no. 2, 348-363.

CROSSREFS

Sequence in context: A193204 A091504 A098137 * A012444 A012754 A083568

Adjacent sequences:  A014979 A014980 A014981 * A014983 A014984 A014985

KEYWORD

nonn

AUTHOR

Victor Reiner (reiner(AT)math.umn.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:45 EST 2012. Contains 205866 sequences.