login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211934 Number of distinct finite languages over binary alphabet, whose minimum regular expression has alphabetic width n. 0
2, 4, 24, 182, 1652, 16854, 186114 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 06:53 EDT 2020. Contains 337289 sequences. (Running on oeis4.)