T(n,k) is the number of parking functions of length n with cars parking at most k spots away from their preferred spot; square array T(n,k), n>=0, k>=0, read by downward antidiagonals.
A365623
T(n,k) is the number of parking functions of length n with cars parking at most k spots away from their preferred spot; square array T(n,k), n>=0, k>=0, read by downward antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =1a(7) =1a(8) =3a(9) =6a(10) =1a(11) =1a(12) =3a(13) =13a(14) =24a(15) =1a(16) =1a(17) =3a(18) =16a(19) =75a(20) =120a(21) =1a(22) =1a(23) =3a(24) =16a(25) =109a(26) =541a(27) =720a(28) =1a(29) =1
External references
- oeis: A365623