|
|
A263867
|
|
Number of non-overlapping permutations of length n. A permutation is non-overlapping (sometimes called minimally overlapping) if the shortest permutation containing two occurrences of it as a consecutive pattern has length 2n-1.
|
|
2
|
|
|
|
OFFSET
|
2,1
|
|
LINKS
|
|
|
FORMULA
|
For n>=3, a(n) is divisible by 4 (shown in the Elizalde/McNamara link).
The limit of a(n)/n! is approximately 0.364 (shown by M. Bóna).
An implicit formula of a(n) is given in Section 3 of Pan and Remmel's paper.
|
|
EXAMPLE
|
There are 4 non-overlapping permutations of length 3, namely 132, 213, 231 and 312.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|