login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260156 Number of minimal overlapping permutations starting with 1 of length n. 1
1, 1, 3, 9, 50, 276, 1995, 15715, 142506, 1421010 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

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 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)/(n-1)! 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

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

License Agreements, Terms of Use, Privacy Policy .

Last modified September 26 06:54 EDT 2017. Contains 292502 sequences.