Proof step

Geometric basis map (elementary)

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

Concludes
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.
Premises
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-1ca381ee9c7d5d3d · JSON
Operation
Image under a basis map u^k -> P_k
{
  "map": "A013611",
  "operation": "basis_map"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
Certificate
basis_map, SHA-256 752ac4856e4793f247dee85ef30d342e1f79c0d38596712e64eebb3e8353ff61, 11,870 bytes (2,213 compressed); download
polytool replayed the certificate when the step was written.
Cited by