In general, let A(n,k,m) denote the (n,k)-th entry of the inverse of the matrix consisting of the (n,k)-th m-restrained Stirling numbers of the second kind (-1)^(n-k) times the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, as the (n+1,k+1)-th entry. The sequence shows A(n,k,3), which is a lower triangular matrix, read by rows.
A171998
In general, let A(n,k,m) denote the (n,k)-th entry of the inverse of the matrix consisting of the (n,k)-th m-restrained Stirling numbers of the second kind (-1)^(n-k) times the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, as the (n+1,k+1)-th entry. The sequence shows A(n,k,3), which is a lower triangular matrix, read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =-5a(7) =7a(8) =6a(9) =1a(10) =-65a(11) =-15a(12) =25a(13) =10a(14) =1a(15) =-455a(16) =-455a(17) =0a(18) =65a(19) =15a(20) =1a(21) =-1295a(22) =-4725a(23) =-1715a(24) =140a(25) =140a(26) =21a(27) =1
External references
- oeis: A171998