Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.
A211952
Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.
Terms
- a(0) =5a(1) =9a(2) =33a(3) =117a(4) =391a(5) =1350a(6) =4546a(7) =15753a(8) =55053a(9) =196185
External references
- oeis: A211952