login
Number of distinct regular languages over unary alphabet, whose minimum regular expression has reverse Polish length n.
0

%I #13 Feb 22 2021 13:25:12

%S 3,1,2,2,3,4,6,7,11,15

%N Number of distinct regular languages over unary alphabet, whose minimum regular expression has reverse Polish length n.

%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