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 A291134 #12 Feb 24 2019 08:42:10
%S A291134 1,1103,269512,38643849,4218834608,393933602129,33499946915016,
%T A291134 2693983725947891,209859823775671984,16093162912317174422,
%U A291134 1228462028909579534968,94081283153407041089350,7269699339591280955315232,569088494101518607733459806
%N A291134 Number of defective parking functions of length n and defect eight.
%H A291134 Alois P. Heinz, <a href="/A291134/b291134.txt">Table of n, a(n) for n = 9..386</a>
%H A291134 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 A291134 a(n) ~ (73*exp(1)/40320 - 296*exp(2)/315 + 405*exp(3)/16 - 2432*exp(4)/15 + 9625*exp(5)/24 - 468*exp(6) + 553*exp(7)/2 - 80*exp(8) + 9*exp(9)) * n^(n-1). - _Vaclav Kotesovec_, Aug 19 2017
%p A291134 S:= (n, k)-> add(binomial(n, i)*k*(k+i)^(i-1)*(n-k-i)^(n-i), i=0..n-k):
%p A291134 a:= n-> S(n, 8)-S(n, 9):
%p A291134 seq(a(n), n=9..23);
%t A291134 S[n_, k_] := Sum[Binomial[n, i]*k*(k+i)^(i-1)*(n-k-i)^(n-i), {i, 0, n-k}];
%t A291134 a[n_] := S[n, 8] - S[n, 9];
%t A291134 Table[a[n], {n, 9, 23}] (* _Jean-François Alcover_, Feb 24 2019, from Maple *)
%Y A291134 Column k=8 of A264902.
%K A291134 nonn
%O A291134 9,2
%A A291134 _Alois P. Heinz_, Aug 18 2017