A211937 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A211937

Number of distinct regular languages over 4-ary alphabet, whose minimum regular expression has alphabetic width n

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

%S 2,12,288,9312,357911

%N Number of distinct regular languages over 4-ary 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