%I #16 Feb 22 2021 15:46:01
%S 3,2,3,5,9,14,24,41,71,118
%N Number of distinct finite languages over unary alphabet, whose minimum regular expression has reverse Polish length 2n-1.
%H Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, <a href="http://arxiv.org/abs/1204.4982">Enumerating regular expressions and their languages</a>, arXiv:1204.4982v1 [cs.FL], 2012.
%K nonn,more
%O 1,1
%A _Hermann Gruber_, Apr 26 2012