OFFSET
0,3
COMMENTS
This sequence enumerates lucky cars in parking functions of order n (where a lucky spot is one which is parked in by a car which prefers that spot).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..386
Steve Butler, Kimberly Hadaway, Victoria Lenius, Preston Martens, and Marshall Moats, Lucky cars and lucky spots in parking functions, arXiv:2412.07873 [math.CO], 2024. See p. 10.
MAPLE
b:= proc(n) option remember; `if`(n=0, 1,
expand(x*mul((n+1-k)+k*x, k=2..n)))
end:
a:= n-> add(k*coeff(b(n), x, k), k=1..n):
seq(a(n), n=0..20); # Alois P. Heinz, Aug 21 2024
MATHEMATICA
b[n_] := b[n] = If[n == 0, 1, Expand[x*Product[(n+1-k) + k*x, {k, 2, n}]]];
a[n_] := Sum[k*Coefficient[b[n], x, k], {k, 1, n}];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Aug 31 2024, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Kimberly P. Hadaway, Aug 21 2024, suggested by Andrew Howroyd
EXTENSIONS
a(6)-a(19) from Alois P. Heinz, Aug 21 2024
STATUS
approved