The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211948 Number of distinct finite languages over unary alphabet, whose minimum regular expression has ordinary length n. 0
3, 1, 2, 3, 3, 5, 5, 8, 9, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Table of n, a(n) for n=1..10.
Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL]
CROSSREFS
Sequence in context: A106601 A325533 A110030 * A021766 A286357 A135564
Adjacent sequences: A211945 A211946 A211947 * A211949 A211950 A211951
KEYWORD
nonn,hard
AUTHOR
Hermann Gruber, Apr 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 05:55 EDT 2024. Contains 372498 sequences. (Running on oeis4.)