OFFSET
3,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 3..1000
S. Butler and S. Osborne, Counting tilings by taking walks, 2012.
FORMULA
G.f.: 2*x^3*(25+36*x-333*x^2-6*x^3+467*x^4-104*x^5-71*x^6+18*x^7)/((1-x)*(1+x)*(1-4*x+x^2)*(1-2*x-x^2)*(1+2*x-x^2)). - Sergey Perepechko, Oct 21 2013
Assuming the above o.g.f. we have, for n >= 1, a(2n+1) = 2*A001834(n)^2 = (2 + sqrt(3))^(2*n+1) + (2 - sqrt(3))^(2*n+1) - 2. - Peter Bala, Apr 19 2014
MATHEMATICA
CoefficientList[Series[2 (25 + 36 x - 333 x^2 - 6 x^3 + 467 x^4 - 104 x^5 - 71 x^6 + 18 x^7)/((1 - x) (1 + x) (1 - 4 x + x^2) (1 - 2 x - x^2) (1 + 2 x - x^2)), {x, 0, 40}], x] (* Vincenzo Librandi, Apr 20 2014 *)
PROG
(PARI) Vec( 2*x^3*(25+36*x-333*x^2-6*x^3+467*x^4-104*x^5-71*x^6+18*x^7)/((1-x)*(1+x)*(1-4*x+x^2)*(1-2*x-x^2)*(1+2*x-x^2)) +O(x^66) ) \\ Joerg Arndt, Oct 22 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Dec 27 2012
EXTENSIONS
More terms from Joerg Arndt, Oct 22 2013
STATUS
approved