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.

A228675 Number of permutations of [n] having a shortest ascending run of length 8.

This page as a plain text file.
%I A228675 #5 Aug 29 2013 23:46:48
%S A228675 1,0,0,0,0,0,0,0,12869,48618,87514,151162,251938,406978,639538,980626,
%T A228675 9465511769,78873015651,432930149084,1733817767377,6029279272390,
%U A228675 19272571329943,58176504195256,168427982998609,100010235685036911,1461261128736451029
%N A228675 Number of permutations of [n] having a shortest ascending run of length 8.
%H A228675 Alois P. Heinz, <a href="/A228675/b228675.txt">Table of n, a(n) for n = 8..100</a>
%Y A228675 Column k=8 of A064315.
%K A228675 nonn
%O A228675 8,9
%A A228675 _Alois P. Heinz_, Aug 29 2013