Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014982
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 2, 12, 272, 21666 (list; graph; listen)
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: A012546 A091504 A098137 this_sequence A012444 A012754 A083568

Adjacent sequences: A014979 A014980 A014981 this_sequence A014983 A014984 A014985

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research