A236410 The 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.

3, 10, 47, 273, 1849, 14270, 126123, 1269115, 14001629, 169410932, 2224759333, 31405982419, 477984780009, 7790605829001, 134802717252851, 2484103902746813, 48154650577942207, 984377185382274242, 21143511558425405345

Offset

2,1

Links

Marek Szykuła, Table of n, a(n) for n = 2..716

Janusz Brzozowski and Marek Szykuła, Large Aperiodic Semigroups, Int'l J. Foundat. Comp. Sci. (2015) Vol. 26, No. 7,913-931, 2015. See also arXiv:1401.0157 [cs.FL], 2013.

Crossrefs

Sequence in context: A346055 A249479 A355154 * A386374 A339836 A385544

Adjacent sequences: A236407 A236408 A236409 * A236411 A236412 A236413

Keyword

nonn

Author

N. J. A. Sloane, Jan 31 2014

Extensions

Corrected and extended by Marek Szykula, May 31 2025

Status

approved