Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Combinatorial Functions > StirlingS1 >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Integer Functions > Combinatorial Functions > StirlingS1 >

StirlingS1

StirlingS1
gives the Stirling number of the first kind .
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • gives the number of permutations of elements that contain exactly cycles.
StirlingS1 threads element-wise over lists:
TraditionalForm formatting:
Plot Stirling numbers of the first kind on a logarithmic scale:
Plot the average number of cycles in symmetric group elements:
Generate values from the generating function:
Stirling numbers of the first kind are effectively inverses of Stirling numbers of the second kind:
Calculate large Stirling numbers of the first kind using Cauchy's theorem:
StirlingS1 can have large values for moderately sized arguments:
The value at is defined to be 1:
Plot sums of digits:
New in 1
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF