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 [-1564556493/268435456, -46056243/268435456] (13)
-
A297191: Irregular triangle read by rows formed by taking every other row of the Delannoy array (A008288) regarded as a triangle.
basis-map coefficients of A297191, shifted → basis A0082881 · 1, 3, 1 · 1, 7, 13, 7, 1 … row sums 1, 5, 29, 169, 985, 5741, 33461, …
-
A123519 → basis A008288
11, 18, 4 · 41, 112, 60, 8 · 153, 592, 548, 168, 16 … row sums 33, 221, 1477, 9865, 65885, 440025, …
-
A013611 → basis A008288
1 · 5, 4 · 25, 56, 16 · 125, 476, 368, 64 … row sums 1, 9, 97, 1033, 11009, 117321, 1250273, …
-
A013609 → basis A008288
1 · 3, 2 · 9, 16, 4 · 27, 82, 52, 8 … row sums 1, 5, 29, 169, 985, 5741, 33461, …
-
A010054: a(n) = 1 if n is a triangular number, otherwise 0.
1 · 1 · 1 · 1 … row sums 1, 1, 1, 1, 1, 1, 1, 1, …
-
A013622 → basis A008288
1 · 8, 5 · 64, 105, 25 · 512, 1435, 850, 125 … row sums 1, 13, 194, 2922, 44036, 663668, …
-
A063007 → basis A008288
1 · 3, 2 · 13, 24, 6 · 63, 202, 130, 20 … row sums 1, 5, 43, 415, 4201, 43741, 463891, …
-
A008288: Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.
1 · 1, 1 · 1, 3, 1 · 1, 5, 5, 1 … row sums 1, 2, 5, 12, 29, 70, 169, 408, …
-
A013610 → basis A008288
1 · 4, 3 · 16, 33, 9 · 64, 225, 162, 27 … row sums 1, 7, 58, 478, 3940, 32476, 267688, …
-
A033282 → basis A008288
1 · 3, 2 · 11, 20, 5 · 45, 142, 91, 14 … row sums 1, 5, 36, 292, 2535, 23051, 216736, …
-
delannoy
1 · 1, 1 · 1, 3, 1 · 1, 5, 5, 1 … row sums 1, 2, 5, 12, 29, 70, 169, 408, …
-
A358735 → basis A008288
1 · 2, 1 · 7, 10, 2 · 33, 88, 46, 6 … row sums 1, 3, 19, 173, 1999, 27955, 458845, …
-
A013620 → basis A008288
1 · 5, 3 · 25, 39, 9 · 125, 333, 189, 27 … row sums 1, 8, 73, 674, 6229, 57572, 532117, …