OFFSET
2,3
COMMENTS
A permutation is minimal overlapping if the shortest permutation containing two consecutive occurrences of it has length 2n-1. It is also called non-overlapping. A263867(n) is number of minimal overlapping permutations of length n.
LINKS
Ran Pan, Jeffrey B. Remmel, Minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays, arXiv:1510.08190 [math.CO], 2015.
FORMULA
The limit of a(n)/(n-1)! is approximately 0.392 (R. Pan and J. Remmel).
EXAMPLE
There are 3 minimal overlapping permutations starting with 1 of length 4: 1342, 1432, 1243.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Ran Pan, Nov 09 2015
STATUS
approved