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 [2, 1, 3].
A211286
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 [2, 1, 3].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =70a(5) =195a(6) =545a(7) =1526a(8) =4284a(9) =12056a(10) =34013a(11) =96195a(12) =272718a(13) =775011a(14) =2207557a(15) =6302309a(16) =18031941a(17) =51702239a(18) =148548283a(19) =427644891a(20) =1233449265a(21) =3564068374a(22) =10316244428a(23) =29909714061a(24) =86852526228a(25) =252579033621a(26) =735567723900
External references
- oeis: A211286