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, 2, 2].
A211287
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, 2, 2].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =71a(5) =201a(6) =571a(7) =1621a(8) =4611a(9) =13127a(10) =37415a(11) =106763a(12) =304991a(13) =872267a(14) =2497519a(15) =7159191a(16) =20545393a(17) =59028011a(18) =169782251a(19) =488892391a(20) =1409342969a(21) =4067217153a(22) =11750311255a(23) =33983345183a(24) =98387605609a(25) =285144063989a(26) =827236307471
External references
- oeis: A211287