

A260156


Number of minimal overlapping permutations starting with 1 of length n.


1




OFFSET

2,3


COMMENTS

A permutation is minimal overlapping if the shortest permutation containing two consecutive occurrences of it has length 2n1. It is also called nonoverlapping. A263867(n) is number of minimal overlapping permutations 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)/(n1)! 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

Cf. A263867
Sequence in context: A190009 A012063 A036751 * A058110 A261542 A171951
Adjacent sequences: A260153 A260154 A260155 * A260157 A260158 A260159


KEYWORD

nonn,more


AUTHOR

Ran Pan, Nov 09 2015


STATUS

approved



