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
%I A014982
%S A014982 1,1,2,12,272,21666
%N 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.
%D A014982 For definition of "coherent", see L J. Billera and B. Sturmfels, Iterated 
               fiber polytopes, Mathematika, 41 (1994), no. 2, 348-363.
%Y A014982 Sequence in context: A012546 A091504 A098137 this_sequence A012444 A012754 
               A083568
%Y A014982 Adjacent sequences: A014979 A014980 A014981 this_sequence A014983 A014984 
               A014985
%K A014982 nonn
%O A014982 1,3
%A A014982 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research