login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I

%S 2,4,12,48,280,1864,14840,132276,1323504

%N 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.

%H Miklós Bóna, <a href="http://www.mat.unisi.it/newsito/puma/public_html/22_2/bona.pdf">Non-overlapping permutation patterns</a>, PU. M. A. 22(2):99-105, 2011.

%H Sergi Elizalde, Peter R. W. McNamara, <a href="http://arxiv.org/abs/1508.05963">The structure of the consecutive pattern poset</a>, arXiv:1508.05963 [math.CO], 2015.

%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 For n>=3, a(n) is divisible by 4 (shown in the Elizalde/McNamara link).

%F The limit of a(n)/n! is approximately 0.364 (shown by M. Bóna).

%F An implicit formula of a(n) is given in Section 3 of Pan and Remmel's paper.

%e There are 4 non-overlapping permutations of length 3, namely 132, 213, 231 and 312.

%K nonn,more

%O 2,1

%A _Sergi Elizalde_, Oct 28 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 09:46 EDT 2022. Contains 356977 sequences. (Running on oeis4.)