A145596 → Pₙ + Pₙ₊₁
nonnegative coefficients
Proved for all n: all roots real what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 2 | 5 | |||||||
| 1 | 5 | 10 | 3 | 18 | ||||||
| 2 | 7 | 28 | 23 | 4 | 62 | |||||
| 3 | 9 | 60 | 95 | 44 | 5 | 213 | ||||
| 4 | 11 | 110 | 285 | 250 | 75 | 6 | 737 | |||
| 5 | 13 | 182 | 700 | 994 | 560 | 118 | 7 | 2574 | ||
| 6 | 15 | 280 | 1498 | 3136 | 2842 | 1120 | 175 | 8 | 9074 | |
| 7 | 17 | 408 | 2898 | 8400 | 11172 | 7056 | 2058 | 248 | 9 | 32266 |
Computed in your browser ?
Technical details
- Node id
n-449f6ebb0d4b8f65· revision 1 · JSON- Definition source
derived:obreschkoff_combination- Fingerprint
f6-525cf34517a99f35
Observed on the stored rows ?
- Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (affine: slope 1, intercept 1)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
OEIS matches ?
No OEIS matches.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 3, 2; 1: 5, 10, 3; 2: 7, 28, 23, 4; 3: 9, 60, 95, 44, 5; 4: 11, 110, 285, 250, 75, 6; 5: 13, 182, 700, 994, 560, 118, 7; 6: 15, 280, 1498, 3136, 2842, 1120, 175, 8; 7: 17, 408, 2898, 8400, 11172, 7056, 2058, 248, 9; 8: 19, 570, 5190, 19908, 36540, 33768, 15750, 3540, 339, 10; 9: 21, 770, 8745, 42900, 103950, 132264, 90090, 32340, 5775, 450, 11;
%F FormulaThe row polynomials satisfy (4*n^3+32*n^2+65*n+25+(n^3+7*n^2+11*n+5)*x^2)*P(n,x) = (4*n^3+36*n^2+95*n+75+(12*n^3+64*n^2+102*n+50)*x+(n^3+12*n^2+26*n+15)*x^2+(3*n^3+14*n^2+21*n+10)*x^3)*P(n-1,x) + ((8*n^2+36*n+34)*x-(8*n^2+30*n+22)*x^2+(2*n^2-8)*x^3-(2*n^2+6*n+4)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 3 + 2*x.
%t MathematicaP[0, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^3 + 36*n^2 + 95*n + 75 + (12*n^3 + 64*n^2 + 102*n + 50)*x + (n^3 + 12*n^2 + 26*n + 15)*x^2 + (3*n^3 + 14*n^2 + 21*n + 10)*x^3)*P[n - 1, x] + ((8*n^2 + 36*n + 34)*x - (8*n^2 + 30*n + 22)*x^2 + (2*n^2 - 8)*x^3 - (2*n^2 + 6*n + 4)*x^4)*D[P[n - 1, x], x])/(4*n^3 + 32*n^2 + 65*n + 25 + (n^3 + 7*n^2 + 11*n + 5)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 3 + 2*x; for(n = 1, N, my(i = n + 1); v[i] = ((4*n^3 + 36*n^2 + 95*n + 75 + (12*n^3 + 64*n^2 + 102*n + 50)*x + (n^3 + 12*n^2 + 26*n + 15)*x^2 + (3*n^3 + 14*n^2 + 21*n + 10)*x^3)*v[i - 1] + ((8*n^2 + 36*n + 34)*x - (8*n^2 + 30*n + 22)*x^2 + (2*n^2 - 8)*x^3 - (2*n^2 + 6*n + 4)*x^4)*deriv(v[i - 1], x))/(4*n^3 + 32*n^2 + 65*n + 25 + (n^3 + 7*n^2 + 11*n + 5)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-455a924384122a0c
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
obreschkoff_combination
e-455a924384122a0cHermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check liu_wang
e-c483eeee9c2638c9root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-1d2c7b4a3cb3d72fAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-c483eeee9c2638c9(expanded above) -
basis_map A007318
e-fb63394f9047a486Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]
-
preserver_image affine, shift 0
e-3babd9179153850cAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
↵ theorem_check liu_wang
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
↵ basis_map A007318
e-fb63394f9047a486(expanded above) -
preserver_image affine, shift 0
e-239cba93e63d8d6dAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
-
↵ preserver_image affine, shift 0
e-3babd9179153850c(expanded above) -
theorem_check three_term_recurrence
e-8ef8162b0ed7a444root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
↵ preserver_image affine, shift 0
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
Related sequences ?
No candidate equalities or related sequences.
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023