OFFSET
0,2
COMMENTS
The a(n) represent the number of n-move routes of a fairy chess piece starting in the central square (m = 5) 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.
On a 3 X 3 chessboard there are 2^9 = 512 ways to go berserk on the central square (we assume here that a berserker might behave like a rook). The berserker is represented by the A[5] vector in the fifth row of the adjacency matrix A, see the Maple program. For the central squares the 512 berserkers lead to 42 berserker sequences, see the cross-references for some examples.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,3,-6).
FORMULA
G.f.: (1+3*x)/(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(0)=1, a(1)=7 and a(2)=31.
a(n) = -1/2 + (7+6*A)*A^(-n-1)/22 + (7+6*B)*B^(-n-1)/22 with A=(-3+sqrt(33))/12 and B=(-3-sqrt(33))/12.
E.g.f.: exp(x)*(exp(x/2)*(33*cosh(sqrt(33)*x/2) + 7*sqrt(33)*sinh(sqrt(33)*x/2)) - 11)/22. - Stefano Spezia, Mar 20 2026
MATHEMATICA
CoefficientList[Series[(1+3x)/(1-4x-3x^2+6x^3), {x, 0, 40}], x] (* or *) LinearRecurrence[{4, 3, -6}, {1, 7, 31}, 40] (* Harvey P. Dale, Oct 10 2011 *)
CROSSREFS
Cf. Berserker sequences central square [numerical values A[5]]: A000007 [0], A000012 [16], 2*A001835 [17, n>=1 and a(0)=1], A155116 [3], A077829 [7], A000302 [15], 6*A179606 [111, with leading 1 added], 2*A033887 [95, n>=1 and a(0)=1], A180147 [191, this sequence], 2*A180141 [495, n>=1 and a(0)=1], 4*A107979 [383, with leading 1 added].
KEYWORD
easy,nonn
AUTHOR
Johannes W. Meijer, Aug 13 2010
STATUS
approved
