T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and without fixed points.

A144089

T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and without fixed points.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =2a(5) =1a(6) =1a(7) =6a(8) =9a(9) =2a(10) =1a(11) =12a(12) =42a(13) =44a(14) =9a(15) =1a(16) =20a(17) =130a(18) =320a(19) =265a(20) =44a(21) =1a(22) =30a(23) =315a(24) =1420a(25) =2715a(26) =1854a(27) =265a(28) =1a(29) =42

External references