775809domain: 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, 2] as of [2, 1, 3].at n=13A211293Number of n X 2 0..1 arrays with each 1 adjacent to 1 or 3 king-move neighboring 1s.at n=14A295937