|
Search: id:A079103
|
|
| |
|
| 1, 4, 625, 7529536, 9682651996416, 1605976966052654874624, 38858631894268190306056236008241, 149521802722388792654037601564900000000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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
|
|
CROSSREFS
|
Cf. A079102, A079104, A079105, A079106.
Sequence in context: A086143 A123657 A069641 this_sequence A091288 A067171 A046348
Adjacent sequences: A079100 A079101 A079102 this_sequence A079104 A079105 A079106
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Joseph Myers (jsm(AT)polyomino.org.uk), Dec 23 2002
|
|
|
Search completed in 0.002 seconds
|
