OFFSET
0,1
COMMENTS
From Greg Dresden and Wajdi Maaloul, Jun 19 2022: (Start)
a(n) is the number of ways to tile this strip of length n+4 (with a bump in the n=5 position) using squares and dominos.
. _
._______|_|_________ _
|_|_|_|_|_|_|_|_|_|_|...|_|
(End)
LINKS
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
a(0) = 5, a(1) = 13, a(n) = a(n - 2) + a(n - 1).
G.f.: (5 + 8x)/(1 - x - x^2). - Philippe Deléham, Nov 20 2008
E.g.f.: exp(x/2)*(25*cosh(sqrt(5)*x/2) + 21*sqrt(5)*sinh(sqrt(5)*x/2))/5. - Stefano Spezia, Jun 06 2023
MATHEMATICA
LinearRecurrence[{1, 1}, {5, 13}, 50] (* Harvey P. Dale, Jul 10 2017 *)
CoefficientList[Series[(5 + 8x)/(1 - x - x^2), {x, 0, 50}], x] (* Stefano Spezia, Oct 11 2018 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved