Proof step

Geometric basis map (elementary)

Image under a basis map u^k -> P_k A007318

Concludes
shift_x_plus_one of Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).
Premises
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-9e748e197fdf43a2 · JSON
Operation
Image under a basis map u^k -> P_k
{
  "map": "A007318",
  "operation": "basis_map"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
basis_map, SHA-256 0b492716a9e25a006039e552cdc742b5adc21ab899efce85a1111ac0cc758c28, 14,621 bytes (2,912 compressed); download
polytool replayed the certificate when the step was written.
Cited by