OFFSET
1,2
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..200
Spencer Daugherty, Pamela E. Harris, Ian Klein, and Matt McClinton, Metered Parking Functions, arXiv:2406.12941 [math.CO], 2024. See pp. 18, 22.
EXAMPLE
Case n = 2: There are 3 parking functions of length 2: [1, 1], [1, 2], [2, 1]. Summing up the initial values gives 1 + 1 + 2 = 4, so a(2) = 4.
PROG
(PARI) \\ here T(n, k) is A298592(n, k).
T(n, k)={sum(j=k, n, binomial(n-1, j-1)*j^(j-2)*(n+1-j)^(n-1-j))}
a(n)={sum(k=1, n, k*T(n, k))}
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Oct 25 2019
STATUS
approved