login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195649 Number of ways to place 10n nonattacking kings on a 20 x 2n chessboard. 4

%I #19 Mar 26 2023 16:04:39

%S 11264,5266069,714611200,50123713793,2335042206624,82425144219429,

%T 2383116363555182,59315924213143597,1314578079936797520,

%U 26568150968269086211,498306336520679626558,8788579757709800395287,147246060712874767006100,2362334876238883501403023

%N Number of ways to place 10n nonattacking kings on a 20 x 2n chessboard.

%H Alex V. Breger, <a href="/A195649/b195649.txt">Table of n, a(n) for n = 1..500</a>

%H Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>

%H Vaclav Kotesovec, <a href="/A195649/a195649_1.txt">Generating function</a>

%F Recurrence order is 1318.

%Y Column k=10 of A350819.

%Y Cf. A018807, A195654, A195659.

%K nonn

%O 1,1

%A _Vaclav Kotesovec_, Sep 22 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)