|
| |
|
|
A094218
|
|
Number of permutations of length n with exactly 2 occurrences of the pattern 2-13.
|
|
6
| |
|
|
0, 0, 0, 2, 25, 198, 1274, 7280, 38556, 193800, 937992, 4412826, 20309575, 91861770, 409704750, 1806342720, 7887861960, 34166674800, 146977222320, 628521016500, 2673950235138, 11324837666604, 47773836727540, 200828153398752
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
REFERENCES
| R. Lie, Permutations and Patterns, Master's Thesis, Goeteborg, Sweden: Chalmers University of Technology, 2004.
Robert Parviainen, Lattice Path Enumeration of Permutations with k Occurrences of the Pattern 2-13, Journal of Integer Sequences, Vol. 9 (2006), Article 06.3.2.
|
|
|
FORMULA
| a(n)=n*binomial(2*n,n-4)/2
|
|
|
PROG
| (PARI) a(n)=n*binomial(2*n, n-4)/2
|
|
|
CROSSREFS
| Cf. A094219.
Sequence in context: A009381 A063264 A024533 * A203767 A206392 A074438
Adjacent sequences: A094215 A094216 A094217 * A094219 A094220 A094221
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 27 2004
|
| |
|
|
