99449domain: NAppears in sequencesa(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [2, 1, 2].at n=11A211285Semiprimes that contain only digits 4 and 9.at n=14A368337