OFFSET
1,1
COMMENTS
Fault-free tilings are those where the only straight interface is at the left and right end. Thus a(n) <= A084480(n).
If the conjectured G.F. in A183304 is true, then a(n)= 2*A183304(n-1), n>3. - R. J. Mathar, Dec 02 2022
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,1).
FORMULA
G.f.: 2*z*(1+z)^2*(1-z-z^3) / (1-2*z-z^3).
a(n) = 2*a(n-1) + a(n-3) for n>6. - Colin Barker, Mar 28 2017
PROG
(PARI) Vec(2*x*(1 + x)^2*(1 - x - x^3) / (1 - 2*x - x^3) + O(x^30)) \\ Colin Barker, Mar 28 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, May 27 2003
STATUS
approved