A260159 Number of minimal overlapping permutations starting with 2 of length n.

1, 2, 3, 11, 46, 278, 1875, 15081, 135674, 1363050

Offset

2,2

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 the number of minimal overlapping permutations of length n.

a(n) is asymptotically less than A260156(n) which is the number of minimal overlapping permutations starting with 1 of length n.

Links

Table of n, a(n) for n=2..11.

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.384 (R. Pan and J. Remmel).

Example

There are 3 minimal overlapping permutations starting with 2 of length 4: 2341, 2431, 2134.

Crossrefs

Cf. A260156, A263867.

Sequence in context: A107327 A162101 A128455 * A287060 A041345 A268285

Adjacent sequences: A260156 A260157 A260158 * A260160 A260161 A260162

Keyword

nonn,more

Author

Ran Pan, Nov 09 2015

Status

approved