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 A284205 #8 Apr 03 2017 10:34:46
%S A284205 0,0,0,0,0,0,0,40320,322560,2943360,30078720,339696000,4196666880,
%T A284205 56255149440,812752093440,12585067447680,207863095910400,
%U A284205 3646938237505920,67723519234210560,1326863186062565760,27349945952061841920,591598086412112035200
%N A284205 Ninth column of Euler's difference table in A068106.
%C A284205 For n >= 9, this is the number of permutations of [n] that avoid substrings j(j+8), 1 <= j <= n-8.
%H A284205 Enrique Navarrete, <a href="http://arxiv.org/abs/1610.06217">Generalized K-Shift Forbidden Substrings in Permutations</a>, arXiv:1610.06217 [math.CO], 2016.
%F A284205 For n>=9: a(n) = Sum_{j=0..n-8} (-1)^j*binomial(n-8,j)*(n-j)!.
%F A284205 Note a(n)/n! ~ 1/e.
%e A284205 a(12)=339696000 since this is the number of permutations in S12 that avoid substrings {19,2(10),3(11),4(12)}.
%t A284205 With[{k = 9}, ConstantArray[0, k - 2]~Join~Table[Sum[(-1)^j*Binomial[n - (k - 1), j] (n - j)!, {j, 0, n - (k - 1)}], {n, k - 1, k + 12}]] (* _Michael De Vlieger_, Mar 26 2017 *)
%Y A284205 Also 40320 times A176734.
%Y A284205 Cf. A068106.
%K A284205 nonn
%O A284205 1,8
%A A284205 _Enrique Navarrete_, Mar 22 2017