This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A228672 #10 Sep 07 2014 08:11:54 %S A228672 1,0,0,0,0,251,922,1582,2572,4002,756755,6029297,31742676,120956707, %T A228672 398182782,12794989968,166170816448,1418774022895,9698826682676, %U A228672 55499002033421,894582818429967,14637215156295242,177486208140377619,1730337098015002802 %N A228672 Number of permutations of [n] having a shortest ascending run of length 5. %H A228672 Alois P. Heinz and Vaclav Kotesovec, <a href="/A228672/b228672.txt">Table of n, a(n) for n = 5..350</a> (first 100 terms from Alois P. Heinz) %F A228672 a(n) ~ c * d^n * n!, where d = 0.4206507959..., c = 0.1811532007... . - _Vaclav Kotesovec_, Sep 07 2014 %Y A228672 Column k=5 of A064315. %K A228672 nonn %O A228672 5,6 %A A228672 _Alois P. Heinz_, Aug 29 2013