Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A189283 Number of permutations p of 1,2,...,n satisfying p(i+4)-p(i)<>4 for all 1<=i<=n-4. 4
1, 1, 2, 6, 24, 114, 628, 4062, 30360, 255186, 2414292, 25350954, 292378968, 3673917102, 49928069188, 729534877758, 11403682481112, 189862332575658, 3354017704180052, 62654508729565554, 1233924707891272728, 25550498290562247438 (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[4,4] on an n X n chessboard.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..27 (Updated Jan 19 2019)
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 644.
FORMULA
Asymptotics (V. Kotesovec, Mar 2011): a(n)/n! ~ (1 + 7/n + 12/n^2)/e.
CROSSREFS
Sequence in context: A171448 A068199 A189846 * A177522 A216717 A174072
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 22:11 EDT 2024. Contains 375284 sequences. (Running on oeis4.)