powered by
Stirling numbers of the second kind and permutation of positive integers.
stirling(n) permut(n)
a vector with stirling numbers.
a positive integer.
Christophe Dutang.
stirling computes stirling numbers of second kind i.e. $$Stirl_n^k = k * Stirl_{n-1}^k + Stirl_{n-1}^{k-1}$$ with \(Stirl_n^1 = Stirl_n^n = 1\). e.g.
stirling
\(n = 0\), returns 1
\(n = 1\), returns a vector with 0,1
\(n = 2\), returns a vector with 0,1,1
\(n = 3\), returns a vector with 0,1,3,1
\(n = 4\), returns a vector with 0,1,7,6,1...
Go to wikipedia for more details.
permut compute permutation of \({1, ..., n}\) and store it in a matrix. e.g.
permut
\(n=1\), returns a matrix with
\(n=2\), returns a matrix with
\(n=3\) returns a matrix with
choose for combination numbers.
choose
# should be 1 stirling(0) # should be 0,1,7,6,1 stirling(4)
Run the code above in your browser using DataLab