Quartz 4

Home

❯

Stirling Numbers First Kind

Stirling Numbers First Kind

Feb 01, 20261 min read

  • uni/DisMat

Number of permutations of [n] that consist of exactly k disjoint cycles.
siehe: cycles of permutations

s(n+1,k)=ns(n,k)+s(n−2,k−1)

unsigned Stirling Numbers First Kind






Graph View

Backlinks

  • Stirling Numbers
  • cycles of permutations

Created with Quartz v4.5.1 © 2026

  • GitHub
  • Discord Community