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 A291136 #12 Feb 24 2019 08:41:46
%S A291136 1,4215,2127828,530926606,92071525556,12851428617547,1561750852160556,
%T A291136 173226805226723844,18081637592017744356,1813499364725872444178,
%U A291136 177350996523515552397628,17092810524840161845093436,1636375630004710170560408532,156537967540558397590739941650
%N A291136 Number of defective parking functions of length n and defect ten.
%H A291136 Alois P. Heinz, <a href="/A291136/b291136.txt">Table of n, a(n) for n = 11..386</a>
%H A291136 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 A291136 a(n) ~ (37*exp(1)/1209600 - 32*exp(2)/405 + 27459*exp(3)/4480 - 9728*exp(4)/105 + 71875*exp(5)/144 - 6264*exp(6)/5 + 13377*exp(7)/8 - 3776*exp(8)/3 + 1071*exp(9)/2 - 120*exp(10) + 11*exp(11)) * n^(n-1). - _Vaclav Kotesovec_, Aug 19 2017
%p A291136 S:= (n, k)-> add(binomial(n, i)*k*(k+i)^(i-1)*(n-k-i)^(n-i), i=0..n-k):
%p A291136 a:= n-> S(n, 10)-S(n, 11):
%p A291136 seq(a(n), n=11..23);
%t A291136 S[n_, k_] := Sum[Binomial[n, i]*k*(k+i)^(i-1)*(n-k-i)^(n-i), {i, 0, n-k}];
%t A291136 a[n_] := S[n, 10] - S[n, 11];
%t A291136 Table[a[n], {n, 11, 23}] (* _Jean-François Alcover_, Feb 24 2019, from Maple *)
%Y A291136 Column k=10 of A264902.
%K A291136 nonn
%O A291136 11,2
%A A291136 _Alois P. Heinz_, Aug 18 2017