login
A260156
Number of minimal overlapping permutations starting with 1 of length n.
1
1, 1, 3, 9, 50, 276, 1995, 15715, 142506, 1421010
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.
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
Sequence in context: A012063 A372421 A036751 * A058110 A261542 A079836
KEYWORD
nonn,more
AUTHOR
Ran Pan, Nov 09 2015
STATUS
approved