|
|
|
|
0, 1, 36, 1369, 51984, 1974025, 74960964, 2846542609, 108093658176, 4104712468081, 155870980128900, 5918992532430121, 224765845252215696, 8535183127051766329, 324112192982714904804, 12307728150216114616225
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
See the comment in A099279. This is example a=6.
a(n+1) is the number of tilings of an n-board (a board with dimensions n X 1) using half-squares (1/2 X 1 pieces, always placed so that the shorter sides are horizontal) and (1/2,1/2)-fences if there are 6 kinds of half-squares available. A (w,g)-fence is a tile composed of two w X 1 pieces separated horizontally by a gap of width g. a(n+1) also equals the number of tilings of an n-board using (1/4,1/4)-fences and (1/4,3/4)-fences if there are 6 kinds of (1/4,1/4)-fences available. - Michael A. Allen, Apr 21 2023
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 37*a(n-1) + 37*a(n-2) - a(n-3), n >= 3; a(0)=0, a(1)=1, a(2)=36.
a(n) = 38*a(n-1) - a(n-2) - 2*(-1)^n, n >= 2; a(0)=0, a(1)=1.
a(n) = (T(n, 19) - (-1)^n)/20 with the Chebyshev polynomials of the first kind: T(n, 19) = A078986(n).
G.f.: x*(1-x)/((1 - 38*x + x^2)*(1+x)) = x*(1-x)/(1 - 37*x - 37*x^2 + x^3).
a(n) = (1 - (-1)^n)/2 + 36*Sum_{r=1..n-1} r*a(n-r). - Michael A. Allen, Apr 21 2023
|
|
MAPLE
|
with (combinat):seq(fibonacci(n, 6)^2, n=0..15); # Zerinvary Lajos, Apr 09 2008
|
|
MATHEMATICA
|
LinearRecurrence[{37, 37, -1}, {0, 1, 36}, 20] (* Harvey P. Dale, Sep 23 2018 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|