A211940 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A211940

Number of distinct finite languages over unary alphabet, whose minimum regular expression has reverse Polish length 2n-1.

3, 2, 3, 5, 9, 14, 24, 41, 71, 118

(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], 2012.

CROSSREFS

Sequence in context: A241816 A243109 A206012 * A230664 A374833 A175717

Adjacent sequences: A211937 A211938 A211939 * A211941 A211942 A211943

KEYWORD

nonn,more

AUTHOR

Hermann Gruber, Apr 26 2012

STATUS

approved