a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [1, 2].
A211276
a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [1, 2].
Terms
- a(0) =1a(1) =3a(2) =7a(3) =18a(4) =47a(5) =123a(6) =328a(7) =886a(8) =2419a(9) =6675a(10) =18587a(11) =52164a(12) =147404a(13) =418991a(14) =1197002a(15) =3434568a(16) =9891715a(17) =28580469a(18) =82808899a(19) =240511642a(20) =700024987a(21) =2041255981a(22) =5962023006a(23) =17439034426a(24) =51075928264a(25) =149767494573a(26) =439619556301
External references
- oeis: A211276