login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A211947
Number of distinct regular languages over unary alphabet, whose minimum regular expression has ordinary length n.
0
3, 2, 3, 4, 5, 9, 12, 17, 25, 33
(
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:
A335944
A035366
A114751
*
A220071
A132408
A091821
Adjacent sequences:
A211944
A211945
A211946
*
A211948
A211949
A211950
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 September 15 17:22 EDT 2024. Contains 375938 sequences. (Running on oeis4.)