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 A284204 #9 Apr 06 2017 21:26:32
%S A284204 0,0,0,0,0,0,5040,35280,287280,2656080,27422640,312273360,3884393520,
%T A284204 52370755920,760381337520,11824686110160,196038409800240,
%U A284204 3450899827705680,64272619406504880,1262590566656060880,26087355385405781040,565510731026706254160
%N A284204 Eighth column of Euler's difference table in A068106.
%C A284204 For n >= 8, this is the number of permutations of [n] that avoid substrings j(j+7), 1 <= j <= n-7.
%H A284204 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 A284204 For n>=8: a(n) = Sum_{j=0..n-7} (-1)^j*binomial(n-7,j)*(n-j)!.
%F A284204 Note a(n)/n! ~ 1/e.
%e A284204 a(11)=27422640 since this is the number of permutations in S11 that avoid substrings {18,29,3(10),4(11)}.
%t A284204 With[{k = 8}, 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 A284204 Also 5040 times A176733.
%Y A284204 Cf. A068106.
%K A284204 nonn
%O A284204 1,7
%A A284204 _Enrique Navarrete_, Mar 22 2017