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 [3, 1, 3].
A211296
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 [3, 1, 3].
Terms
- a(0) =1a(1) =3a(2) =9a(3) =25a(4) =69a(5) =190a(6) =525a(7) =1457a(8) =4063a(9) =11384a(10) =32042a(11) =90575a(12) =257063a(13) =732301a(14) =2093325a(15) =6002925a(16) =17264587a(17) =49786402a(18) =143922204a(19) =416980589a(20) =1210571810a(21) =3521070621a(22) =10258832781a(23) =29936167744a(24) =87480549441a(25) =255971381746a(26) =749874535899
External references
- oeis: A211296