|
| |
|
|
A079103
|
|
Catalan(n)^(2n-2).
|
|
5
| |
|
|
1, 4, 625, 7529536, 9682651996416, 1605976966052654874624, 38858631894268190306056236008241, 149521802722388792654037601564900000000000000, 97507780747332761768395977098452480878573838263199129993216
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| For n >= 3, the number of permutations of length n(2n-1) in which all monotone subsequences of length n+1 are descending and the number of them is minimal.
|
|
|
LINKS
| Joseph Myers, The minimum number of monotone subsequences, Electronic J. Combin. 9(2) (2002), #R4.
Joseph Myers, The list for n=3
|
|
|
MATHEMATICA
| Table[CatalanNumber[n]^(2n-2), {n, 10}] (* From Harvey P. Dale, Oct 24 2011 *)
|
|
|
CROSSREFS
| Cf. A079102, A079104, A079105, A079106.
Sequence in context: A123657 A195580 A069641 * A191953 A169619 A091288
Adjacent sequences: A079100 A079101 A079102 * A079104 A079105 A079106
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Joseph Myers (jsm(AT)polyomino.org.uk), Dec 23 2002
|
|
|
EXTENSIONS
| a(9) from Harvey P. Dale, Oct 24 2011
|
| |
|
|
