[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211952
Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.
0
5, 9, 33, 117, 391, 1350, 4546, 15753, 55053, 196185
(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: A323150 A116390 A028351 * A098640 A239546 A083832
Adjacent sequences: A211949 A211950 A211951 * A211953 A211954 A211955
KEYWORD
nonn,hard
AUTHOR
Hermann Gruber, Apr 26 2012
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 27 00:31 EST 2024. Contains 378136 sequences.
License Agreements, Terms of Use, Privacy Policy