OFFSET
0,2
COMMENTS
The a(n) represent the number of n-move routes of a fairy chess piece starting in a given side square (m = 2, 4, 6 or 8) on a 3 X 3 chessboard. This fairy chess piece behaves like a rook on the eight side and corner squares but on the central square the rook goes berserk and turns into a berserker, see A180140.
LINKS
Index entries for linear recurrences with constant coefficients, signature (4, 3, -6).
FORMULA
G.f.: 1/(1 - 4*x - 3*x^2 + 6*x^3).
a(n) = 4*a(n-1) + 3*a(n-2) - 6*a(n-3) with a(-2)=0, a(-1)=0, a(0)=1, a(1)=4 and a(2)=19.
a(n) = (-1/8) + (13+30*A)*A^(-n-1)/88 + (13+30*B)*B^(-n-1)/88 with A=(-3+sqrt(33))/12 and B=(-3-sqrt(33))/12.
MAPLE
with(LinearAlgebra): nmax:=22; m:=2; A[5]:=[0, 1, 0, 1, 1, 1, 1, 1, 1]: A:= Matrix([[0, 1, 1, 1, 0, 0, 1, 0, 0], [1, 0, 1, 0, 1, 0, 0, 1, 0], [1, 1, 0, 0, 0, 1, 0, 0, 1], [1, 0, 0, 0, 1, 1, 1, 0, 0], A[5], [0, 0, 1, 1, 1, 0, 0, 0, 1], [1, 0, 0, 1, 0, 0, 0, 1, 1], [0, 1, 0, 0, 1, 0, 1, 0, 1], [0, 0, 1, 0, 0, 1, 1, 1, 0]]): for n from 0 to nmax do B(n):=A^n: a(n):= add(B(n)[m, k], k=1..9): od: seq(a(n), n=0..nmax);
MATHEMATICA
Join[{a=1, b=4}, Table[c=3*b+6*a+1; a=b; b=c, {n, 60}]] (* Vladimir Joseph Stephan Orlovsky, Jan 18 2011 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Johannes W. Meijer, Aug 13 2010
STATUS
approved