Root regions
Nodes grouped by the interval that contains every root of every row (proved, for all n). A node can have several proved regions; the sharpest is the smallest interval.
Nodes with all roots in (-3, 1] (3)
-
A030528 → x ↦ x−1
1 · 0, 1 · -1, 0, 1 · 1, -2, 0, 1 … row sums 1, 1, 0, 0, 0, 0, 0, 0, …
-
A063967 → x ↦ x−2
1 · -1, 1 · 0, -1, 1 · 1, -1, -1, 1 … row sums 1, 0, 0, 0, 0, 0, 0, 0, …
-
A113214 → x ↦ x−1
1 · 1, 1 · -2, 1, 1 · 1, -3, 1, 1 … row sums 1, 2, 0, 0, 0, 0, 0, 0, …