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 A291129 #11 Feb 24 2019 02:00:30
%S A291129 1,46,1442,41070,1166083,34268902,1059688652,34723442062,
%T A291129 1208687001381,44701813604150,1754724115372438,72987949807322222,
%U A291129 3210789166789472775,149073947870611952326,7289995971215959818304,374726414201304528649678,20207920615298454956444905
%N A291129 Number of defective parking functions of length n and defect three.
%H A291129 Alois P. Heinz, <a href="/A291129/b291129.txt">Table of n, a(n) for n = 4..387</a>
%H A291129 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 A291129 a(n) ~ (-13*exp(1)/6 + 14*exp(2) - 15*exp(3) + 4*exp(4)) * n^(n-1). - _Vaclav Kotesovec_, Aug 19 2017
%p A291129 S:= (n, k)-> add(binomial(n, i)*k*(k+i)^(i-1)*(n-k-i)^(n-i), i=0..n-k):
%p A291129 a:= n-> S(n, 3)-S(n, 4):
%p A291129 seq(a(n), n=4..23);
%t A291129 S[n_, k_] := Sum[Binomial[n, i]*k*(k+i)^(i-1)*(n-k-i)^(n-i), {i, 0, n-k}];
%t A291129 a[n_] := S[n, 3] - S[n, 4];
%t A291129 Table[a[n], {n, 4, 23}] (* _Jean-François Alcover_, Feb 24 2019, from Maple *)
%Y A291129 Column k=3 of A264902.
%K A291129 nonn
%O A291129 4,2
%A A291129 _Alois P. Heinz_, Aug 18 2017