cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A180028 Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + 3*x)/(1 - 6*x - 3*x^2).

Original entry on oeis.org

1, 9, 57, 369, 2385, 15417, 99657, 644193, 4164129, 26917353, 173996505, 1124731089, 7270376049, 46996449561, 303789825513, 1963728301761, 12693739287105, 82053620627913, 530402941628793, 3428578511656497
Offset: 0

Views

Author

Johannes W. Meijer, Aug 09 2010; edited Jun 21 2013

Keywords

Comments

The a(n) represent the number of n-move routes of a fairy chess piece starting in the center 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.
On a 3 X 3 chessboard there are 2^9 = 512 ways to explode with fury on the center square (off the center square the piece behaves like a normal queen). The red queen is represented by the A[5] vector in the fifth row of the adjacency matrix A, see the Maple program and A180140. For the center square the 512 red queens lead to 17 red queen sequences, see the overview of red queen sequences and the crossreferences.
The sequence above corresponds to just one red queen vector, i.e., A[5] = [111 111 111] vector. The other squares lead for this vector to A090018.
This sequence belongs to a family of sequences with g.f. (1+k*x)/(1 - 6*x - k*x^2). The members of this family that are red queen sequences are A180028 (k=3; this sequence), A180029 (k=2), A015451 (k=1), A000400 (k=0), A001653 (k=-1), A180034 (k=-2), A084120 (k=-3), A154626 (k=-4) and A000012 (k=-5). Other members of this family are A123362 (k=5), 6*A030192(k=-6).
Inverse binomial transform of A107903.

References

  • Gary Chartrand, Introductory Graph Theory, pp. 217-221, 1984.

Links

Crossrefs

Cf. A180140 (berserker sequences)
Cf. A180032 (Corner and side squares).
Cf. Red queen sequences center square [decimal value A[5]]: A180028 [511], A180029 [255], A180031 [495], A015451 [127], A152240 [239], A000400 [63], A057088 [47], A001653 [31], A122690 [15], A180034 [23], A180036 [7], A084120 [19], A180038 [3], A154626 [17], A015449 [1], A000012 [16], A000007 [0].

Programs

  • Magma
    I:=[1,9]; [n le 2 select I[n] else 6*Self(n-1)+3*Self(n-2): n in [1..20]]; // Vincenzo Librandi, Nov 15 2011
  • Maple
    nmax:=19; m:=5; A[1]:=[0,1,1,1,1,0,1,0,1]: A[2]:=[1,0,1,1,1,1,0,1,0]: A[3]:=[1,1,0,0,1,1,1,0,1]: A[4]:=[1,1,0,0,1,1,1,1,0]: A[5]:=[1,1,1,1,1,1,1,1,1]: A[6]:=[0,1,1,1,1,0,0,1,1]: A[7]:=[1,0,1,1,1,0,0,1,1]: A[8]:=[0,1,0,1,1,1,1,0,1]: A[9]:=[1,0,1,0,1,1,1,1,0]: A:=Matrix([A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[8], A[9]]): 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,3},{1,9},50] (* Vincenzo Librandi, Nov 15 2011 *)

Formula

G.f.: (1+3*x)/(1 - 6*x - 3*x^2).
a(n) = 6*a(n-1) + 3*a(n-2) with a(0) = 1 and a(1) = 9.
a(n) = ((1-A)*A^(-n-1) + (1-B)*B^(-n-1))/4 with A=(-1+2*sqrt(3)/3) and B=(-1-2*sqrt(3)/3).
Lim_{k->infinity} a(n+k)/a(k) = (-1)^(n-1)*A108411(n+1)/(A041017(n-1)*sqrt(12) - A041016(n-1)) for n >= 1.

A208340 Triangle of coefficients of polynomials v(n,x) jointly generated with A202390; see the Formula section.

Original entry on oeis.org

1, 2, 2, 3, 6, 3, 4, 13, 14, 5, 5, 24, 41, 30, 8, 6, 40, 96, 109, 60, 13, 7, 62, 196, 308, 262, 116, 21, 8, 91, 364, 743, 868, 590, 218, 34, 9, 128, 630, 1604, 2413, 2240, 1267, 402, 55, 10, 174, 1032, 3186, 5926, 7046, 5424, 2627, 730, 89, 11, 230, 1617
Offset: 1

Views

Author

Clark Kimberling, Feb 27 2012

Keywords

Comments

v(n,n) = F(n+1), where F=A000045, the Fibonacci numbers.
Alternating row sums of v: (1,0,0,0,0,0,0,0,...).
As triangle T(n,k) with 0 <= k <= n, it is (2, -1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.

Examples

			First five rows:
  1;
  2,  2;
  3,  6,  3;
  4, 13, 14,  5;
  5, 24, 41, 30,  8;
The first five polynomials v(n,x):
  1
  2 +  2x
  3 +  6x +  3x^2
  4 + 13x + 14x^2 +  5x^3
  5 + 24x + 41x^2 + 30x^3 + 8x^4

Crossrefs

Cf. A202390.

Programs

  • Mathematica
    u[1, x_] := 1; v[1, x_] := 1; z = 13;
u[n_, x_] := u[n - 1, x] + x*v[n - 1, x];
v[n_, x_] := (x + 1)*u[n - 1, x] + (x + 1)*v[n - 1, x];
Table[Expand[u[n, x]], {n, 1, z/2}]
Table[Expand[v[n, x]], {n, 1, z/2}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%]    (* A202390 *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%]    (* A208340 *)
Table[u[n, x] /. x -> 1, {n, 1, z}]  (* u row sums *)
Table[v[n, x] /. x -> 1, {n, 1, z}]  (* v row sums *)
Table[u[n, x] /. x -> -1, {n, 1, z}] (* u alt. row sums *)
Table[v[n, x] /. x -> -1, {n, 1, z}] (* v alt. row sums *)

Formula

u(n,x) = u(n-1,x) + x*v(n-1,x), v(n,x) = (x+1)*u(n-1,x) + (x+1)*v(n-1,x), where u(1,x)=1, v(1,x)=1.
From Philippe Deléham, Feb 28 2012: (Start)
As triangle T(n,k) with 0 <= k <= n:
T(n,k) = 2*T(n-1,k) + T(n-1,k-1) - T(n-2,k) + T(n-2,k-2) with T(0,0) = 1, T(1,0) = T(1,1) = 2 and T(n,k) = 0 if k < 0 or if k > n.
G.f.: (1+y*x)/(1-2*x-y*x+x^2-y^2*x^2).
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A000027(n+1), A003946(n), A109115(n), A180031(n) for x = -1, 0, 1, 2, 3 respectively. (End)

A180030 Number of n-move paths on a 3 X 3 chessboard of a queen starting or ending in a corner or side square.

Original entry on oeis.org

1, 6, 38, 238, 1494, 9374, 58822, 369102, 2316086, 14533246, 91194918, 572240558, 3590762134, 22531735134, 141384772742, 887177744782, 5566966905846, 34932256487486, 219197017684198, 1375443140320878, 8630791843077974
Offset: 0

Views

Author

Johannes W. Meijer, Aug 09 2010

Keywords

Comments

The a(n) represent the number of n-move paths of a chess queen starting or ending in a given corner or side square (m = 1, 3, 7, 9; 2, 4, 6, 8) on a 3 X 3 chessboard. The central square leads to A180031.
To determine the a(n) we can either sum the components of the column vector A^n[k,m], with A the adjacency matrix of the queen's graph, or we can sum the components of the row vector A^n[m,k], see the Maple program.
Closely related with this sequence are the red queen sequences, see A180028 and A180032.
Inverse binomial transform of A015555 (without the leading 0).

Links

Programs

  • Magma
    I:=[1,6]; [n le 2 select I[n] else 5*Self(n-1)+8*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 15 2011
  • Maple
    with(LinearAlgebra): nmax:=20; m:=1; A[5]:= [1,1,1,1,0,1,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[{5,8},{1,6},201] (* Vincenzo Librandi, Nov 15 2011 *)

Formula

G.f.: (1+x)/(1 - 5*x - 8*x^2).
a(n) = 5*a(n-1) + 8*a(n-2) with a(0) = 1 and a(1) = 6.
a(n) = ((7+11*A)*A^(-n-1) + (7+11*B)*B^(-n-1))/57 with A = (-5+sqrt(57))/16 and B = (-5-sqrt(57))/16.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.