Number T(n,k) of times the value k appears on the parking functions of length n and such that if we replace that value k with k+1 we don't get a parking function.
A298597
Number T(n,k) of times the value k appears on the parking functions of length n and such that if we replace that value k with k+1 we don't get a parking function.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =9a(4) =6a(5) =9a(6) =64a(7) =36a(8) =36a(9) =64a(10) =625a(11) =320a(12) =270a(13) =320a(14) =625a(15) =7776a(16) =3750a(17) =2880a(18) =2880a(19) =3750a(20) =7776a(21) =117649a(22) =54432a(23) =39375a(24) =35840a(25) =39375a(26) =54432a(27) =117649a(28) =2097152a(29) =941192
External references
- oeis: A298597