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.

A195592 Number of ways to place 4n nonattacking kings on a vertical cylinder 8 X 2n.

Original entry on oeis.org

32, 256, 1220, 4460, 13932, 39316, 103508, 259372, 626780, 1473764, 3392964, 7682812, 17166476, 37942900, 83115188, 180699980, 390351420, 838619524, 1793087780, 3817890076, 8099228012, 17125372436, 36104600340, 75916936300, 159249370652, 333329766436
Offset: 1

Views

Author

Vaclav Kotesovec, Sep 21 2011

Keywords

Comments

Vertical cylinder: a chessboard where it is supposed that the columns 1 and 8 are in contact (number of columns = 8, number of rows = 2n).

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{7,-19,25,-16,4},{32,256,1220,4460,13932},30] (* Harvey P. Dale, Jan 15 2016 *)

Formula

Recurrence: a(n) = 4*a(n-5) - 16*a(n-4) + 25*a(n-3) - 19*a(n-2) + 7*a(n-1).
G.f.: -(1 + 25*x + 51*x^2 + 11*x^3)/((x-1)^3*(2*x-1)^2).
a(n) = (221*n - 779)*2^n + 44*n^2 + 324*n + 780.