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, 1].
A211283
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, 1].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =70a(5) =200a(6) =569a(7) =1614a(8) =4596a(9) =13114a(10) =37431a(11) =106978a(12) =306238a(13) =877713a(14) =2518647a(15) =7236947a(16) =20820856a(17) =59975554a(18) =172974739a(19) =499480558a(20) =1444006498a(21) =4179496707a(22) =12110820951a(23) =35132286213a(24) =102025868324a(25) =296601381043a(26) =863142552053
External references
- oeis: A211283