%I A064315
%S A064315 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,
%T A064315 36287,3853,110,69,0,0,0,1,333395,27555,1679,250,0,0,0,0,1,3382758,
%U A064315 233431,11941,418,251,0,0,0,0,1,37688597,2167152,59470,658,922,0,0,0,0
%N A064315 Triangle of number of permutations by length of shortest ascending run.
%H A064315 D. W. Wilson, <a href="a008304.txt">Extended tables for A008304 and A064315</
               a>
%F A064315 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.
%Y A064315 Sequence in context: A127557 A060524 A133843 this_sequence A099221 A062950 
               A019625
%Y A064315 Adjacent sequences: A064312 A064313 A064314 this_sequence A064316 A064317 
               A064318
%K A064315 nonn,tabl
%O A064315 1,4
%A A064315 David W. Wilson (davidwwilson(AT)comcast.net), Sep 07 2001