login
A211940
Number of distinct finite languages over unary alphabet, whose minimum regular expression has reverse Polish length 2n-1.
0
3, 2, 3, 5, 9, 14, 24, 41, 71, 118
OFFSET
1,1
LINKS
Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, Enumerating regular expressions and their languages, arXiv:1204.4982v1 [cs.FL], 2012.
CROSSREFS
Sequence in context: A241816 A243109 A206012 * A230664 A374833 A175717
KEYWORD
nonn,more
AUTHOR
Hermann Gruber, Apr 26 2012
STATUS
approved