This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A212269 Number of ways to place k non-attacking kings on an n X n cylindrical chessboard, summed over all k >= 0. 6
 2, 5, 19, 205, 3011, 92875, 4763459, 459630701, 78223965193, 24270274906085, 13497818986883771, 13571363009654254429, 24562890586806439035377, 80199120146273882569630015, 471874707649862024071657639861, 5005895207027974222377733802848093 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES S. R. Finch, Mathematical Constants, Cambridge, 2003, p. 343. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..26 V. Kotesovec, Non-attacking chess pieces, 6ed, 2013, p.165 FORMULA Limit n ->infinity (a(n))^(1/n^2) = 1.342643951124... (see A247413). CROSSREFS Cf. A063443(n+1), A067958, A194650-A194654, A182407, A247413, A212269. Sequence in context: A193674 A085871 A202422 * A080280 A218386 A055813 Adjacent sequences:  A212266 A212267 A212268 * A212270 A212271 A212272 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 September 22 12:59 EDT 2019. Contains 327307 sequences. (Running on oeis4.)