31405982419domain: NAppears in sequencesThe size of the largest semiconstant tree aperiodic semigroups on n points (with identity). Currently the largest known transition semigroups of minimal n-state automata recognizing star-free languages, thus a lower bound on the syntactic complexity of star-free languages.at n=11A236410