Proof step

Geometric basis map (elementary)

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

Concludes
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/…
Premises
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-a5c0a64678a49a0c · JSON
Operation
Image under a basis map u^k -> P_k
{
  "map": "A013610",
  "operation": "basis_map"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
basis_map, SHA-256 84449f489b55b55ffa71a86e4cf9865ceb59035c79be511fc41d29aebeabc00f, 14,896 bytes (2,935 compressed); download
polytool replayed the certificate when the step was written.
Cited by