The number of permutations in S_n for which the number of reduced words is maximized with respect to the numbers of braid and commutation classes: |R(w)| = |B(w)| * |C(w)|.
A290953
The number of permutations in S_n for which the number of reduced words is maximized with respect to the numbers of braid and commutation classes: |R(w)| = |B(w)| * |C(w)|.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =16a(4) =45a(5) =136a(6) =434a(7) =1436a(8) =4869a(9) =16804a(10) =58795a(11) =208022a(12) =742911a(13) =2674452a(14) =9694858a(15) =35357684a(16) =129644805a(17) =477638716a(18) =1767263207a(19) =6564120438a(20) =24466267039a(21) =91482563660a(22) =343059613671
External references
- oeis: A290953