A(n,k,m) is the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, called the (n,k)-th m-restrained Stirling numbers of the first kind, and denoted by mS_1(n,k). The sequence shows the case of m=3.
A171996
A(n,k,m) is the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, called the (n,k)-th m-restrained Stirling numbers of the first kind, and denoted by mS_1(n,k). The sequence shows the case of m=3.
Terms
- a(0) =1a(1) =-1a(2) =1a(3) =2a(4) =-3a(5) =1a(6) =0a(7) =11a(8) =-6a(9) =1a(10) =0a(11) =-20a(12) =35a(13) =-10a(14) =1a(15) =0a(16) =40a(17) =-135a(18) =85a(19) =-15a(20) =1a(21) =0a(22) =0a(23) =490a(24) =-525a(25) =175a(26) =-21a(27) =1a(28) =0a(29) =0
External references
- oeis: A171996