a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 3] as of [2, 3, 1].
A211301
a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 3] as of [2, 3, 1].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =71a(5) =203a(6) =579a(7) =1659a(8) =4761a(9) =13683a(10) =39399a(11) =113617a(12) =328141a(13) =949123a(14) =2749119a(15) =7973617a(16) =23157121a(17) =67337563a(18) =196043189a(19) =571406485a(20) =1667307271a(21) =4870143753a(22) =14239758879a(23) =41675219715a(24) =122080952361a(25) =357926363463
External references
- oeis: A211301