login
A211952
Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.
0
5, 9, 33, 117, 391, 1350, 4546, 15753, 55053, 196185
OFFSET
1,1
LINKS
Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL]
CROSSREFS
Sequence in context: A323150 A116390 A028351 * A098640 A239546 A083832
KEYWORD
nonn,hard
AUTHOR
Hermann Gruber, Apr 26 2012
STATUS
approved