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

%S 2,6,56,612,7923,114554,1768133

%N Number of distinct regular languages over binary alphabet, whose minimum regular expression has alphabetic width 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

%O 1,1

%A _Hermann Gruber_, Apr 25 2012