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 A324357 #7 Feb 24 2019 15:05:29
%S A324357 0,1,15,193,2479,33081,464807,6906257,108589887,1805179321,
%T A324357 31676392519,585609896433,11383428770303,232204651095353,
%U A324357 4961029124266599,110811507291845521,2583228239189752447,62748345739947178617,1585780756628964990407,41635723030339339863281
%N A324357 Total number of occurrences of 7 in the (signed) displacement sets of all permutations of [n+7] divided by 7!.
%H A324357 Alois P. Heinz, <a href="/A324357/b324357.txt">Table of n, a(n) for n = 0..444</a>
%H A324357 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%F A324357 E.g.f.: (1-exp(-x))/(1-x)^8.
%F A324357 a(n) = -1/7! * Sum_{j=1..n} (-1)^j * binomial(n,j) * (n+7-j)!.
%F A324357 a(n) = A306234(n+7,7).
%p A324357 a:= n-> (k-> -add((-1)^j*binomial(n, j)*(n+k-j)!, j=1..n)/k!)(7):
%p A324357 seq(a(n), n=0..23);
%Y A324357 Column k=7 of A324362.
%Y A324357 Cf. A306234.
%K A324357 nonn
%O A324357 0,3
%A A324357 _Alois P. Heinz_, Feb 23 2019