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-2 of 2 results.

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).

Original entry on oeis.org

1, 4, 16, 72, 312, 1368, 5976, 26136, 114264, 499608, 2184408, 9550872, 41759064, 182582424, 798301656, 3490399512, 15261008472, 66725422488, 291742318296, 1275579489816, 5577192379224, 24385054076568, 106618316505048
Offset: 0

Views

Author

Johannes W. Meijer, Aug 13 2010

Keywords

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.

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].

Programs

  • 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);
  • Mathematica
    LinearRecurrence[{3, 6}, {1, 4, 16}, 23] (* Jean-François Alcover, Jan 18 2025 *)

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.

A255117 Number of n-length words on {0,1,2,3,4} in which 0 appears only in runs of length 2.

Original entry on oeis.org

1, 4, 17, 72, 304, 1284, 5424, 22912, 96784, 408832, 1726976, 7295040, 30815488, 130169856, 549859584, 2322700288, 9811480576, 41445360640, 175072243712, 739534897152, 3123921031168, 13195973099520, 55742031986688, 235463812071424, 994639140683776
Offset: 0

Views

Author

Milan Janjic, Feb 14 2015

Keywords

Crossrefs

Programs

  • Mathematica
    RecurrenceTable[{a[0] == 1, a[1] == 4,  a[2]== 17, a[n] == 4 a[n - 1] + 4 a[n - 3]}, a[n], {n, 0, 25}]
  • PARI
    Vec(-(x^2+1)/(4*x^3+4*x-1) + O(x^100)) \\ Colin Barker, Feb 15 2015

Formula

a(n+3) = 4*a(n+2) + 4*a(n) with n>1, a(0) = 1, a(1) = 4, a(2) = 17.
G.f.: -(x^2+1) / (4*x^3+4*x-1). - Colin Barker, Feb 15 2015
a(n) = A089979(n) + A089979(n-2). - R. J. Mathar, Aug 04 2019
Showing 1-2 of 2 results.