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, 2, 2].
A211290
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, 2, 2].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =71a(5) =201a(6) =573a(7) =1635a(8) =4677a(9) =13399a(10) =38457a(11) =110559a(12) =318375a(13) =918281a(14) =2652687a(15) =7674389a(16) =22234411a(17) =64506957a(18) =187396863a(19) =545090409a(20) =1587454407a(21) =4628463753a(22) =13509904359a(23) =39475258065a(24) =115460419701a(25) =338030276619a(26) =990539965197
External references
- oeis: A211290