A211950 - OEIS

%I #7 Nov 08 2013 23:36:29

%S 4,4,11,28,63,156,358,888,2194,5665

%N Number of distinct finite languages over binary alphabet, whose minimum regular expression has ordinary length n.

%H Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, <a href="http://arxiv.org/abs/1204.4982">Enumerating regular expressions and their languages</a>, arXiv:1204.4982v1 [cs.FL]

%K nonn,hard

%O 1,1

%A _Hermann Gruber_, Apr 26 2012