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 words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and…
Premises
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-7948a619be1c7999 · 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"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
basis_map, SHA-256 f4407eeee6a78efd8142331f3893a43f1ca88d41eb1d01b51a852e32a632d907, 14,522 bytes (2,902 compressed); download
polytool replayed the certificate when the step was written.
Cited by