A269914 Number of ternary strings of length n with maximal run length two containing 112.

1, 5, 20, 71, 237, 761, 2377, 7278, 21945, 65375, 192861, 564387, 1640496, 4741103, 13634501, 39042437, 111379025, 316687006, 897796581, 2538530615, 7160768785, 20156241155, 56626360256, 158804376883, 444638710925, 1243115597929, 3470779612521, 9678320566654

Offset: 3

Author

Marko Riedel, Mar 07 2016

Keywords

• nonn

Links

• Math StackExchange, Words built with 0,1,2
• Marko Riedel, Maple code by total enumeration and by generating function.
• Index entries for linear recurrences with constant coefficients, signature (3,3,-5,-11,-8,-2).

Crossrefs

Cf. A081038, A269915, A269916, A269917.

Programs

Mathematica

Drop[CoefficientList[Series[x^3 (x + 1) (x^2 + x + 1)/((2 x^2 + 2 x - 1) (x^4 + 3 x^3 + 3 x^2 + x - 1)), {x, 0, 30}], x], 3] (* Michael De Vlieger, Mar 08 2016 *)

Formula

G.f.: x^3*(x+1)*(x^2+x+1)/((2*x^2+2*x-1)*(x^4+3*x^3+3*x^2+x-1)).