STATUS
editing
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A189285
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Number of permutations p of 1,2,...,n satisfying p(i+6)-p(i)<>6 for all 1<=i<=n-6.
(history; published version)
(history; published version)
LINKS
George Spahn and Doron Zeilberger, <a href="https://arxiv.org/abs/2211.02550">Counting Permutations Where The Difference Between Entries Located r Places Apart Can never be s (For any given positive integers r and s)</a>, arXiv:2211.02550 [math.CO], 2022.
STATUS
approved
editing
STATUS
editing
approved
FORMULA
Asymptotic Asymptotics (V. Kotesovec, Mar 2011): a(n)/n! ~ (1 + 11/n + 30/n^2)/e.
STATUS
approved
editing
STATUS
editing
approved
LINKS
V. Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Number of ways of placing nonNon-attacking queens, kings, bishops and knightschess pieces</a> (in English and Czech), 6ed, 2013, p. 644.
STATUS
approved
editing
STATUS
editing
approved
LINKS
Vaclav Kotesovec, <a href="/A189285/b189285.txt">Table of n, a(n) for n = 0..24</a> (Updated Jan 19 2019)
STATUS
approved
editing
LINKS
Vaclav Kotesovec, <a href="/A189285/b189285_2.txt">Table of n, a(n) for n = 0..24</a>
STATUS
editing
approved