Number of states of the Finite State Automaton Gn accepting the language of maximal (or minimal) lexicographic representatives of elements in the positive braid monoid An.

A317849

Number of states of the Finite State Automaton Gn accepting the language of maximal (or minimal) lexicographic representatives of elements in the positive braid monoid An.

Terms

    a(0) =1a(1) =5a(2) =18a(3) =56a(4) =161a(5) =443a(6) =1190a(7) =3156a(8) =8315a(9) =21835a(10) =57246a(11) =149970a(12) =392743a(13) =1028351a(14) =2692416a(15) =7049018a(16) =18454775a(17) =48315461a(18) =126491780a(19) =331160070a(20) =866988641a(21) =2269806085a(22) =5942429868a(23) =15557483796a(24) =40730021821a(25) =106632581993a(26) =279167724510a(27) =730870591916

External references