Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k.
A261762
Triangle read by rows: T(n,k) is the number of subpermutations of an n-set whose orbits are each of size at most k, and without fixed points. Equivalently, T(n,k) is the number of partial derangements of an n-set each of whose orbits is of size at most k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =4a(6) =1a(7) =1a(8) =10a(9) =18a(10) =1a(11) =1a(12) =46a(13) =78a(14) =108a(15) =1a(16) =1a(17) =166a(18) =486a(19) =636a(20) =780a(21) =1a(22) =1a(23) =856a(24) =3096a(25) =4896a(26) =5760a(27) =6600a(28) =1a(29) =1
External references
- oeis: A261762