The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 Nov 10 2015 04:43:10
%S 1,2,3,11,46,278,1875,15081,135674,1363050
%N Number of minimal overlapping permutations starting with 2 of length n.
%C 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 the number of minimal overlapping permutations of length n.
%C a(n) is asymptotically less than A260156(n) which is the number of minimal overlapping permutations starting with 1 of length n.
%H Ran Pan, Jeffrey B. Remmel, <a href="http://arxiv.org/abs/1510.08190">Minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays</a>, arXiv:1510.08190 [math.CO], 2015.
%F The limit of a(n)/(n-1)! is approximately 0.384 (R. Pan and J. Remmel).
%e There are 3 minimal overlapping permutations starting with 2 of length 4: 2341, 2431, 2134.
%Y Cf. A260156, A263867.
%K nonn,more
%O 2,2
%A _Ran Pan_, Nov 09 2015