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!)
A180034 Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 - 2*x)/(1 - 6*x + 2*x^2). 4
1, 4, 22, 124, 700, 3952, 22312, 125968, 711184, 4015168, 22668640, 127981504, 722551744, 4079347456, 23030981248, 130027192576, 734101192960, 4144552772608, 23399114249728, 132105579953152, 745835251219456 (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 the central square (m = 5) on a 3 X 3 chessboard. This fairy chess piece behaves like a white queen on the eight side and corner squares but on the central square the queen explodes with fury and turns into a red queen, see A180028.

The sequence above corresponds to 56 red queen vectors, i.e., A[5] vector, with decimal values varying between 23 and 464. The corner and side squares lead for these vectors to A154244.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Index entries for linear recurrences with constant coefficients, signature (6,-2).

FORMULA

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

a(n) = 6*a(n-1) - 2*a(n-2) with a(0) = 1 and a(1) = 4.

a(n) = ((1+4*A)*A^(-n-1) + (1+4*B)*B^(-n-1))/14 with A = (3+sqrt(7))/2 and B = (3-sqrt(7))/2.

a(n) = A154244(n) - 2*A154244(n-1). - R. J. Mathar, Aug 14 2012

MAPLE

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

LinearRecurrence[{6, -2}, {1, 4}, 50] (* Vincenzo Librandi, Nov 15 2011 *)

PROG

(MAGMA) I:=[1, 4]; [n le 2 select I[n] else 6*Self(n-1)-2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 15 2011

CROSSREFS

Sequence in context: A065983 A236576 A185858 * A260346 A136777 A056625

Adjacent sequences:  A180031 A180032 A180033 * A180035 A180036 A180037

KEYWORD

easy,nonn

AUTHOR

Johannes W. Meijer, Aug 09 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 April 8 14:52 EDT 2020. Contains 333314 sequences. (Running on oeis4.)