|
Search: id:A064315
|
|
|
| A064315 |
|
Triangle of number of permutations by length of shortest ascending run. |
|
+0
2
|
|
| 1, 1, 1, 5, 0, 1, 18, 5, 0, 1, 101, 18, 0, 0, 1, 611, 89, 19, 0, 0, 1, 4452, 519, 68, 0, 0, 0, 1, 36287, 3853, 110, 69, 0, 0, 0, 1, 333395, 27555, 1679, 250, 0, 0, 0, 0, 1, 3382758, 233431, 11941, 418, 251, 0, 0, 0, 0, 1, 37688597, 2167152, 59470, 658, 922, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
D. W. Wilson, Extended tables for A008304 and A064315
|
|
FORMULA
|
Sequence (1, 3, 2, 5, 4) has ascending runs (1, 3), (2, 5), (4), the shortest is length 1. Of all permutations of (1, 2, 3, 4, 5), a(5, 1) = 101 have shortest ascending run of length 1.
|
|
CROSSREFS
|
Adjacent sequences: A064312 A064313 A064314 this_sequence A064316 A064317 A064318
Sequence in context: A127557 A060524 A133843 this_sequence A099221 A062950 A019625
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net), Sep 07 2001
|
|
|
Search completed in 0.002 seconds
|
