Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A211931
Number of distinct regular languages over unary alphabet, whose minimum regular expression has alphabetic width n.
0
2, 3, 6, 14, 30, 72, 155
OFFSET
1,1
LINKS
Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL]
CROSSREFS
Sequence in context: A240749 A331684 A106364 * A264078 A006444 A335242
KEYWORD
hard,more,nonn
AUTHOR
Hermann Gruber, Apr 25 2012
STATUS
approved