login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180141 Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x - 2*x^2)/(1 - 3*x - 6*x^2). 11
1, 4, 16, 72, 312, 1368, 5976, 26136, 114264, 499608, 2184408, 9550872, 41759064, 182582424, 798301656, 3490399512, 15261008472, 66725422488, 291742318296, 1275579489816, 5577192379224, 24385054076568, 106618316505048 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The a(n) represent the number of n-move routes of a fairy chess piece starting in a given corner square (m = 1, 3, 7 or 9) 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 corner squares the 512 berserkers lead to 42 berserker sequences, see the cross-references for some examples.

The sequence above corresponds to just one A[5] vectors with decimal value 495. This vector leads for the side squares to 4*A154964 (for n >= 1 with a(0) = 1) and for the central square to 2*A180141 (for n >= 1 with a(0)=1).

This sequence belongs to a family of sequences with g.f. (1 + x + k*x^2)/(1 - 3*x + (k-4)*x^2), see A123620.

LINKS

Table of n, a(n) for n=0..22.

FORMULA

G.f.: (1 + x - 2*x^2)/(1 - 3*x - 6*x^2).

a(n) = 4*a(n-1) - 2*a(n-3) with a(0)=2, a(1)=8 and a(2)=31.

a(n) = 3*a(n-1) + 6*a(n-2) for n >= 3 with a(0)=1, a(1)=4 and a(2)=16.

a(n) = (6+2*A)*A^(-n-1)/33 + (6+2*B)*B^(-n-1)/33 with A=(-3-sqrt(33))/12 and B=(-3+sqrt(33))/12 for n >= 1 with a(0)=1.

MAPLE

with(LinearAlgebra): nmax:=22; m:=1; A[5]:= [1, 1, 1, 1, 0, 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);

CROSSREFS

Cf. A180140 (side squares) and A180147 (central square).

Cf. Berserker sequences corner squares [numerical value A[5]]: 4*A055099 [0, with leading 1 added], A180143 [16], 4*A001353 [17, n>=1 and a(0)=1], A123620 [3], 2*A018916 [19, with leading 1 added], A000302 [15], 4*A179606 [111, with leading 1 added], A089979 [343], 4*A001076 [95, n>=1 and a(0)=1], A180145 [191], A180141 [495, this sequence], 4*A090017 [383, n>=1 and a(0)=1].

Sequence in context: A330610 A327541 A158784 * A226282 A013991 A151245

Adjacent sequences:  A180138 A180139 A180140 * A180142 A180143 A180144

KEYWORD

easy,nonn

AUTHOR

Johannes W. Meijer, Aug 13 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 03:26 EDT 2021. Contains 347623 sequences. (Running on oeis4.)