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!)
A061594 Number of ways to place 3n nonattacking kings on a 6 X 2n chessboard. 13
1, 32, 408, 3600, 26040, 166368, 976640, 5392704, 28432288, 144605184, 714611200, 3449705600, 16333065216, 76081271168, 349524164224, 1586790140800, 7130144209024, 31752978219904, 140298397039232, 615604372260736 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
H. S. Wilf, The problem of the kings, Elec. J. Combin. 2, 1995.
FORMULA
G.f.: (1+13x-52x^2-20x^3+60x^4-20x^5)/((1-3x)(1-4x)^2(1-4x+2x^2)^2).
Explicit formula: (231n-2377)*4^n - 384*3^n + (1953*sqrt(2)/2+1381+(35*sqrt(2)+99/2)*n)*(2+sqrt(2))^n + (1381-1953*sqrt(2)/2+(99/2-35*sqrt(2))*n)*(2-sqrt(2))^n. - Vaclav Kotesovec, Feb 06 2010
PROG
(PARI) a(n)=polcoeff((1+13*x-52*x^2-20*x^3+60*x^4-20*x^5)/((1-3*x)*(1-4*x)^2*(1-4*x+2*x^2)^2)+x*O(x^n), n)
CROSSREFS
Column k=3 of A350819.
Equals 231*A002697(n+1) - 2608*A000302(n) - 384*A000244(n) + 1103*A007070(n-1) + 780*A006012(n+1) + (n+1)*(17*A048580(n) + 12*A007070(n+1)).
Sequence in context: A068548 A195191 A275232 * A145403 A125116 A145217
KEYWORD
nonn,nice
AUTHOR
Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 22 2001
EXTENSIONS
Corrected data by Vincenzo Librandi, Oct 12 2011
STATUS
approved

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 April 19 11:31 EDT 2024. Contains 371792 sequences. (Running on oeis4.)