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 (-1, 3] (3)
-
A063967 → x ↦ x−4
1 · -3, 1 · 6, -5, 1 · -9, 15, -7, 1 … row sums 1, -2, 2, 0, -4, 8, -8, 0, …
-
A030528 → x ↦ x−3
1 · -2, 1 · 3, -4, 1 · -3, 10, -6, 1 … row sums 1, -1, 0, 2, -4, 4, 0, -8, …
-
A113214 → x ↦ x−3
1 · -1, 1 · 0, -3, 1 · 3, 5, -5, 1 … row sums 1, 0, -2, 4, -4, 0, 8, -16, …