Welcome guest
You're not logged in.
277 users online, thereof 1 logged in

Proposition: Recursive Formula for the Stirling Numbers of the First Kind

The Stirling numbers of the first kind obey the following recursive formula $$\left[\begin{array}{c}n+1\\r\end{array}\right]=\left[\begin{array}{c}n\\r-1\end{array}\right]+n\cdot \left[\begin{array}{c}n\\r\end{array}\right]$$
with the initial conditions $$\begin{align}\left[\begin{array}{c}n\\n\end{array}\right]&:=1,\quad n\ge 1\nonumber\\\left[\begin{array}{c}n\\r\end{array}\right]&:=0,\quad r=0 < n\text{ or }n < r.\nonumber\end{align}$$

| | | | | created: 2020-04-04 11:44:40 | modified: 2020-04-04 12:21:45 | by: bookofproofs | references: [8404]

1.Proof: (related to "Recursive Formula for the Stirling Numbers of the First Kind")

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)

[8404] Miller, Kenneth S.: “An Introduction to the Calculus of Finite Differences And Difference Equations”, Dover Publications, Inc, 1960