Number of distinct finite languages over binary alphabet, whose minimum regular expression has alphabetic width n.
A211934
Number of distinct finite languages over binary alphabet, whose minimum regular expression has alphabetic width n.
Terms
- a(0) =2a(1) =4a(2) =24a(3) =182a(4) =1652a(5) =16854a(6) =186114
External references
- oeis: A211934