login
Number of distinct regular languages over unary alphabet, whose minimum regular expression has alphabetic width n.
0

%I #12 Aug 23 2013 17:23:06

%S 2,3,6,14,30,72,155

%N Number of distinct regular languages over unary 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 hard,more,nonn

%O 1,1

%A _Hermann Gruber_, Apr 25 2012