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.

A212271 Number of ways to place k non-attacking ferses on an n x n cylindrical chessboard, summed over all k >= 0.

Original entry on oeis.org

2, 9, 80, 1600, 79033, 8156736, 2055960192, 1108756350625, 1411080429618656, 3943472747846953216, 25425527581172360096017, 365481944233773616212640000, 11980566143208960475692367828480, 882106482533191605447029340350009049, 147314997388032765439791110273770608260928
Offset: 1

Views

Author

Vaclav Kotesovec, May 12 2012

Keywords

Comments

Fers is a leaper [1,1].

Crossrefs

Formula

Limit n ->infinity (a(n))^(1/n^2) is the hard square entropy constant A085850.