106978domain: NAppears in sequencesDuplicate of A130134.at n=6A033555Terms in A015922 not divisible by 3.at n=15A130133Even terms in A015922.at n=6A130134a(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 [1, 2, 1].at n=11A211283