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!)
 A189284 Number of permutations p of 1,2,...,n satisfying p(i+5)-p(i)<>5 for all 1<=i<=n-5. 3
 1, 1, 2, 6, 24, 120, 696, 4572, 34260, 290328, 2751480, 28686024, 328764732, 4106158164, 55495145304, 806797105320, 12554890849992, 208164423163908, 3663256621120548, 68188490015132040, 1338490745511631080, 27630826605742438968 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is also number of ways to place n nonattacking pieces rook + semi-leaper[5,5] on an n X n chessboard. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..26 (Updated Jan 19 2019) 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 (V. Kotesovec, Mar 2011): a(n)/n! ~ (1 + 9/n + 20/n^2)/e. CROSSREFS Cf. A000255, A189281, A189282, A189283, A189256. Sequence in context: A177527 A068200 A189847 * A274970 A177525 A177532 Adjacent sequences:  A189281 A189282 A189283 * A189285 A189286 A189287 KEYWORD nonn,hard AUTHOR Vaclav Kotesovec, Apr 19 2011 EXTENSIONS Terms a(25)-a(26) 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 August 9 18:32 EDT 2020. Contains 336326 sequences. (Running on oeis4.)