a(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 [1, 1, 3].
A211288
a(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 [1, 1, 3].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =69a(5) =189a(6) =519a(7) =1431a(8) =3969a(9) =11077a(10) =31107a(11) =87867a(12) =249523a(13) =711987a(14) =2040201a(15) =5868009a(16) =16932645a(17) =49000221a(18) =142153251a(19) =413303355a(20) =1203986079a(21) =3513322887a(22) =10267781301a(23) =30048790725a(24) =88045917831a(25) =258268671963a(26) =758350570077
External references
- oeis: A211288