cp's OEIS Frontend

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.

A228671 Number of permutations of [n] having a shortest ascending run of length 4.

This page as a plain text file.
%I A228671 #11 Sep 07 2014 06:08:17
%S A228671 1,0,0,0,69,250,418,658,34649,266267,1369372,5082045,76637635,
%T A228671 876858377,7147459470,47396097511,552146011437,7418289082402,
%U A228671 82776784289657,769968963165506,9270154198456497,136873296441831662,1900983368776814542,22997984983317347728
%N A228671 Number of permutations of [n] having a shortest ascending run of length 4.
%H A228671 Alois P. Heinz and Vaclav Kotesovec, <a href="/A228671/b228671.txt">Table of n, a(n) for n = 4..400</a> (first 100 terms from Alois P. Heinz)
%F A228671 a(n) ~ c * d^n * n!, where d = 0.50498188279961731119..., c = 0.223130847130100218... . - _Vaclav Kotesovec_, Sep 07 2014
%e A228671 T(4) = 1: 1234.
%e A228671 T(8) = 69: 12354678, 12364578, ..., 46781235, 56781234.
%Y A228671 Column k=4 of A064315.
%K A228671 nonn
%O A228671 4,5
%A A228671 _Alois P. Heinz_, Aug 29 2013