The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212271 Number of ways to place k non-attacking ferses on an n x n cylindrical chessboard, summed over all k >= 0. 4
 2, 9, 80, 1600, 79033, 8156736, 2055960192, 1108756350625, 1411080429618656, 3943472747846953216, 25425527581172360096017, 365481944233773616212640000, 11980566143208960475692367828480, 882106482533191605447029340350009049, 147314997388032765439791110273770608260928 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Fers is a leaper [1,1]. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..18 V. Kotesovec, Non-attacking chess pieces, 6ed, 2013, p.443 FORMULA Limit n ->infinity (a(n))^(1/n^2) is the hard square entropy constant A085850. CROSSREFS Cf. A067965, A067960, A182407, A212269, A212270. Sequence in context: A279055 A320946 A135868 * A147302 A301861 A112670 Adjacent sequences:  A212268 A212269 A212270 * A212272 A212273 A212274 KEYWORD nonn,hard AUTHOR Vaclav Kotesovec, May 12 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 13:32 EDT 2021. Contains 345416 sequences. (Running on oeis4.)