A140647 Number of car parking assignments of n cars in n spaces, if one car does not park.

1, 10, 107, 1346, 19917, 341986, 6713975, 148717762, 3674435393, 100284451730, 2998366140915, 97510068994690, 3428106725444117, 129590070259759042, 5242767731544271343, 226057515078414496898, 10350122253780835777545, 501543984793431059579122

Offset: 2

Author

Jonathan Vos Post, Jul 09 2008

Keywords

• nonn

Examples

			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].
		

Links

• Alois P. Heinz, Table of n, a(n) for n = 2..380
• Peter J. Cameron, Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer, Counting Defective Parking Functions

Crossrefs

Cf. A000272.

Column k=1 of A264902.

Formula

a(n) = 2*(n+2)^(n-1)-(3*n+1)*(n+1)^(n-2). - Vladeta Jovovic, Jul 21 2008

a(n) = 2*A007830(n-1)-A016777(n)*A007830(n-2). - R. J. Mathar, Aug 09 2008

a(n) ~ (2*exp(2) - 3*exp(1)) * n^(n-1). - Vaclav Kotesovec, Aug 19 2017

Extensions

Extended beyond a(10) by R. J. Mathar, Aug 09 2008