OFFSET
0,2
COMMENTS
See comment and FAMP code for A111569.
Floretion Algebra Multiplication Program, FAMP Code: 4ibaseseq[B+H] with B = - .25'i + .25'j - .25i' + .25j' + k' - .5'kk' - .25'ik' - .25'jk' - .25'ki' - .25'kj' - .5e and H = + .75'ii' + .75'jj' + .75'kk' + .75e
From Greg Dresden and Jiaqi Wang, Jun 24 2023: (Start)
For n >= 5, a(n) is also the number of ways to tile this "central staircase" figure of length n-2 with squares and dominoes. This is the picture for length 9; there are a(11)=112 ways to tile it:
_
_________|_|_____
|_|_|_|_|_|_|_|_|_|
|_| (End)
LINKS
Index entries for linear recurrences with constant coefficients, signature (1, 0, 1, 1).
FORMULA
G.f.: (1-4*x+x^2)/((1+x^2)*(x^2+x-1))
From Greg Dresden and Jiaqi Wang, Jun 24 2023: (Start)
a(2*n) = F(n+1)*L(n-1) + F(n)*F(n-1),
a(2*n+1) = F(n+1)*(F(n+1) + 2*F(n-1)), for F(n) and L(n) the Fibonacci and Lucas numbers.
(End)
CROSSREFS
KEYWORD
easy,sign
AUTHOR
Creighton Dement, Aug 10 2005
STATUS
approved