a(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, 2].
A211284
a(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, 2].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =70a(5) =197a(6) =554a(7) =1563a(8) =4416a(9) =12502a(10) =35463a(11) =100783a(12) =286965a(13) =818614a(14) =2339534a(15) =6698297a(16) =19211785a(17) =55197778a(18) =158857016a(19) =457932482a(20) =1322162806a(21) =3823263357a(22) =11071998176a(23) =32109724225a(24) =93248516464a(25) =271155229971a(26) =789479244108
External references
- oeis: A211284