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, 1, 2].
A211282
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, 1, 2].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =72a(5) =206a(6) =591a(7) =1695a(8) =4868a(9) =13992a(10) =40254a(11) =115910a(12) =334061a(13) =963651a(14) =2782289a(15) =8040281a(16) =23255445a(17) =67322421a(18) =195062233a(19) =565667619a(20) =1641798752a(21) =4769187284a(22) =13865312394a(23) =40343201394a(24) =117479128677a(25) =342369174063a(26) =998540774477
External references
- oeis: A211282