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 A291130 #11 Feb 24 2019 02:00:36
%S A291130 1,87,4320,176843,6768184,256059854,9846223168,390516805362,
%T A291130 16102219296008,693122084961945,31208245366326896,1470819863019421317,
%U A291130 72549461960461640120,3743176448672690767272,201836660477563528892704,11362223977488695430091444
%N A291130 Number of defective parking functions of length n and defect four.
%H A291130 Alois P. Heinz, <a href="/A291130/b291130.txt">Table of n, a(n) for n = 5..386</a>
%H A291130 Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer, <a href="https://arxiv.org/abs/0803.0302">Counting Defective Parking Functions</a>, arXiv:0803.0302 [math.CO], 2008.
%F A291130 a(n) ~ (7*exp(1)/8 - 44*exp(2)/3 + 69*exp(3)/2 - 24*exp(4) + 5*exp(5)) * n^(n-1). - _Vaclav Kotesovec_, Aug 19 2017
%p A291130 S:= (n, k)-> add(binomial(n, i)*k*(k+i)^(i-1)*(n-k-i)^(n-i), i=0..n-k):
%p A291130 a:= n-> S(n, 4)-S(n, 5):
%p A291130 seq(a(n), n=5..23);
%t A291130 S[n_, k_] := Sum[Binomial[n, i]*k*(k+i)^(i-1)*(n-k-i)^(n-i), {i, 0, n-k}];
%t A291130 a[n_] := S[n, 4] - S[n, 5];
%t A291130 Table[a[n], {n, 5, 23}] (* _Jean-François Alcover_, Feb 24 2019, from Maple *)
%Y A291130 Column k=4 of A264902.
%K A291130 nonn
%O A291130 5,2
%A A291130 _Alois P. Heinz_, Aug 18 2017