login
A211947
Number of distinct regular languages over unary alphabet, whose minimum regular expression has ordinary length n.
0
3, 2, 3, 4, 5, 9, 12, 17, 25, 33
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: A335944 A035366 A114751 * A220071 A132408 A091821
KEYWORD
nonn,hard
AUTHOR
Hermann Gruber, Apr 26 2012
STATUS
approved