Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #34 Dec 15 2024 04:36:45
%S 2,5,19,205,3011,92875,4763459,459630701,78223965193,24270274906085,
%T 13497818986883771,13571363009654254429,24562890586806439035377,
%U 80199120146273882569630015,471874707649862024071657639861,5005895207027974222377733802848093
%N Number of ways to place k non-attacking kings on an n X n cylindrical chessboard, summed over all k >= 0.
%D Steven R. Finch, Mathematical Constants, Cambridge, 2003, p. 343.
%H Vaclav Kotesovec, <a href="/A212269/b212269.txt">Table of n, a(n) for n = 1..27</a>
%H Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p.165
%F Limit n ->infinity (a(n))^(1/n^2) = 1.342643951124... (see A247413).
%Y Cf. A063443 (n+1), A067958, A194650-A194654, A182407, A247413, A212269.
%K nonn,hard
%O 1,1
%A _Vaclav Kotesovec_, May 12 2012