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

A211942

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

Terms

    a(0) =4a(1) =7a(2) =25a(3) =109a(4) =514a(5) =2641a(6) =14354a(7) =81325a(8) =475936a(9) =2854145

External references