A211947 - OEIS

A211947

Number of distinct regular languages over unary alphabet, whose minimum regular expression has ordinary length n.

3, 2, 3, 4, 5, 9, 12, 17, 25, 33 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,1`
	LINKS	`Table of n, a(n) for n=1..10.` `Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL]`
	CROSSREFS	`Sequence in context: A335944 A035366 A114751 * A220071 A132408 A091821` `Adjacent sequences: A211944 A211945 A211946 * A211948 A211949 A211950`
	KEYWORD	`nonn,hard`
	AUTHOR	`Hermann Gruber, Apr 26 2012`
	STATUS	`approved`

Last modified January 28 12:24 EST 2023. Contains 359874 sequences. (Running on oeis4.)