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!)
 A189255 Number of permutations p of 1,2,...,n satisfying |p(i+4)-p(i)|<>4 for all 1<=i<=n-4. 6
 1, 2, 6, 24, 108, 544, 3264, 23040, 176832, 1563392, 15536160, 171172224, 2066033472, 27146652480, 385447394880, 5878028516736, 95776238793504, 1660164417866304, 30496085473606944, 591661117634375040, 12087628978334638752 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) is also number of ways to place n nonattacking pieces rook + leaper[4,4] on an n X n chessboard. REFERENCES Roberto Tauraso, The Dinner Table Problem: The Rectangular Case, INTEGERS, vol. 6 (2006), paper A11. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..27 V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech) Vaclav Kotesovec, Mathematica program for this sequence FORMULA Asymptotic (R. Tauraso 2006, quadratic term V. Kotesovec 2011): a(n)/n! ~ (1 + 12/n + 64/n^2)/e^2. CROSSREFS Cf. A002464, A110128, A117574. Sequence in context: A178594 A277248 A189840 * A324591 A338987 A174076 Adjacent sequences:  A189252 A189253 A189254 * A189256 A189257 A189258 KEYWORD nonn,hard AUTHOR Vaclav Kotesovec, Apr 19 2011 EXTENSIONS Terms a(26)-a(27) from Vaclav Kotesovec, Apr 20 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 July 31 14:25 EDT 2021. Contains 346374 sequences. (Running on oeis4.)