Numbers n for which exactly one length minimal language exists having exactly n nonempty words over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A294129
Numbers n for which exactly one length minimal language exists having exactly n nonempty words over a countably infinite alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
Terms
- a(0) =0a(1) =1a(2) =3a(3) =7a(4) =17a(5) =43a(6) =119a(7) =351a(8) =1115a(9) =3735a(10) =13231a(11) =48927a(12) =189079a(13) =757583a(14) =3148063a(15) =13497599a(16) =59704335a(17) =271503647a(18) =1268817471a(19) =6078518911a(20) =29837183007a(21) =149789875903a(22) =768674514815
External references
- oeis: A294129