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 A140647 #20 Aug 19 2017 07:12:54 %S A140647 1,10,107,1346,19917,341986,6713975,148717762,3674435393,100284451730, %T A140647 2998366140915,97510068994690,3428106725444117,129590070259759042, %U A140647 5242767731544271343,226057515078414496898,10350122253780835777545,501543984793431059579122 %N A140647 Number of car parking assignments of n cars in n spaces, if one car does not park. %H A140647 Alois P. Heinz, <a href="/A140647/b140647.txt">Table of n, a(n) for n = 2..380</a> %H A140647 Peter J. Cameron, Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer, <a href="http://arxiv.org/abs/0803.0302">Counting Defective Parking Functions</a> %F A140647 a(n) = 2*(n+2)^(n-1)-(3*n+1)*(n+1)^(n-2). - _Vladeta Jovovic_, Jul 21 2008 %F A140647 a(n) = 2*A007830(n-1)-A016777(n)*A007830(n-2). - _R. J. Mathar_, Aug 09 2008 %F A140647 a(n) ~ (2*exp(2) - 3*exp(1)) * n^(n-1). - _Vaclav Kotesovec_, Aug 19 2017 %e A140647 a(3) = 10: [1,3,3], [2,2,2], [2,2,3], [2,3,2], [2,3,3], [3,1,3], [3,2,2], [3,2,3], [3,3,1], [3,3,2]. %Y A140647 Cf. A000272. %Y A140647 Column k=1 of A264902. %K A140647 nonn %O A140647 2,2 %A A140647 _Jonathan Vos Post_, Jul 09 2008 %E A140647 Extended beyond a(10) by _R. J. Mathar_, Aug 09 2008