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.

A194647 Number of ways to place 5n nonattacking kings on a 10 X 2n cylindrical chessboard.

Original entry on oeis.org

192, 708, 3036, 13932, 66532, 327192, 1649420, 8500668, 44693472, 239238888, 1301236304, 7177627944, 40078823652, 226167613792, 1287874058656, 7390391650172, 42688584938548, 247956702607932, 1447080255512308, 8479116559291112, 49852445684576540
Offset: 1

Views

Author

Vaclav Kotesovec, Aug 31 2011

Keywords

Comments

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

Crossrefs

Formula

G.f.: -2*(7089408*x^21 - 132938496*x^20 + 1125112128*x^19 - 5717239392*x^18 + 19578445344*x^17 - 48082847384*x^16 + 88003026752*x^15 - 123138008952*x^14 + 134072006560*x^13 - 114991853490*x^12 + 78336556962*x^11 - 42596878318*x^10 + 18524447581*x^9 - 6435525481*x^8 + 1778018953*x^7 - 387290192*x^6 + 65568715*x^5 - 8436954*x^4 + 796245*x^3 - 51918*x^2 + 2088*x - 39)/((x-1)*(2*x-1)*(4*x-1)*(6*x-1)*(x^2-4*x+1)*(2*x^2-5*x+1)*(2*x^2-4*x+1)*(4*x^2-6*x+1)*(6*x^2-6*x+1)*(7*x^2-6*x+1)*(2*x^3-8*x^2+6*x-1)*(3*x^3-9*x^2+6*x-1)).
Asymptotic: a(n) ~ 2*6^n.