Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Aug 29 2013 23:29:15
%S 1,0,0,0,0,0,923,3430,6004,10008,16014,24750,17153135,139520497,
%T 747544744,2907714483,9788905840,30236892651,2389382438831,
%U 33146052783575,291048293120402,2033077226586965,11881137473504364,61473838487159979,1656802388288612691
%N Number of permutations of [n] having a shortest ascending run of length 6.
%H Alois P. Heinz, <a href="/A228673/b228673.txt">Table of n, a(n) for n = 6..100</a>
%Y Column k=6 of A064315.
%K nonn
%O 6,7
%A _Alois P. Heinz_, Aug 29 2013