Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Nov 09 2015 05:28:39
%S 1,1,3,9,50,276,1995,15715,142506,1421010
%N Number of minimal overlapping permutations starting with 1 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 number of minimal overlapping permutations 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.392 (R. Pan and J. Remmel).
%e There are 3 minimal overlapping permutations starting with 1 of length 4: 1342, 1432, 1243.
%Y Cf. A263867
%K nonn,more
%O 2,3
%A _Ran Pan_, Nov 09 2015