A211934 Number of distinct finite languages over binary alphabet, whose minimum regular expression has alphabetic width n.

2, 4, 24, 182, 1652, 16854, 186114

Offset

1,1

Links

Table of n, a(n) for n=1..7.

Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL]

Crossrefs

Sequence in context: A018988 A012587 A012292 * A012592 A121892 A032107

Adjacent sequences: A211931 A211932 A211933 * A211935 A211936 A211937

Keyword

nonn

Author

Hermann Gruber, Apr 25 2012

Status

approved