4660656826

Appears in sequences

• a(n) = number of n-lettered words in the alphabet {1, 2, 3, 4} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 3].at n=17A211305