The number of permutations in S_n for which the number of reduced words is minimized with respect to the numbers of braid and commutation classes: |R(w)| = |B(w)| + |C(w)| - 1.
A290954
The number of permutations in S_n for which the number of reduced words is minimized with respect to the numbers of braid and commutation classes: |R(w)| = |B(w)| + |C(w)| - 1.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =23a(4) =65a(5) =177a(6) =506a(7) =1551a(8) =5041a(9) =17049a(10) =59131a(11) =208469a(12) =743491a(13) =2675189a(14) =9695778a(15) =35358815a(16) =129646177a(17) =477640361a(18) =1767265159a(19) =6564122733a(20) =24466269715a(21) =91482566757a(22) =343059617231
External references
- oeis: A290954