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 (-4, 0) (6)
-
A165253: Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.
1 · 1 · 1, 1 · 1, 3, 1 … row sums 1, 1, 2, 5, 13, 34, 89, 233, …
-
A085478: Triangle read by rows: T(n, k) = binomial(n + k, 2*k).
1 · 1, 1 · 1, 3, 1 · 1, 6, 5, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …
-
A111125: Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.
1 · 3, 1 · 5, 5, 1 · 7, 14, 7, 1 … row sums 1, 4, 11, 29, 76, 199, 521, 1364, …
-
A207607: Triangle of coefficients of polynomials v(n,x) jointly generated with A207606; see Formula section.
1 · 1, 2 · 1, 5, 2 · 1, 9, 9, 2 … row sums 1, 3, 8, 21, 55, 144, 377, 987, …
-
A078812: Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).
1 · 2, 1 · 3, 4, 1 · 4, 10, 6, 1 … row sums 1, 3, 8, 21, 55, 144, 377, 987, …
-
A207606: Triangle of coefficients of polynomials u(n,x) jointly generated with A207607; see the Formula section.
4, 7, 2 · 5, 16, 11, 2 · 6, 30, 36, 15, 2 … row sums 13, 34, 89, 233, 610, 1597, 4181, …