login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A211950
Number of distinct finite languages over binary alphabet, whose minimum regular expression has ordinary length n.
0
4, 4, 11, 28, 63, 156, 358, 888, 2194, 5665
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: A048223 A358825 A214112 * A014012 A371550 A273391
KEYWORD
nonn,hard
AUTHOR
Hermann Gruber, Apr 26 2012
STATUS
approved