A008277 → θ+2 (shift +1) → x ↦ x+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 2 | |||||||
| 1 | 5 | 3 | 8 | ||||||
| 2 | 15 | 17 | 4 | 36 | |||||
| 3 | 52 | 84 | 39 | 5 | 180 | ||||
| 4 | 203 | 419 | 286 | 74 | 6 | 988 | |||
| 5 | 877 | 2183 | 1945 | 755 | 125 | 7 | 5892 | ||
| 6 | 4140 | 11990 | 13084 | 6740 | 1695 | 195 | 8 | 37852 | |
| 7 | 21147 | 69541 | 89348 | 57120 | 19285 | 3395 | 287 | 9 | 260132 |
Computed in your browser ?
Technical details
- Node id
n-ebbce5356dede62c· revision 1 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-1b51648b831a15d9
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept 0)
- 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: 2; 1: 5, 3; 2: 15, 17, 4; 3: 52, 84, 39, 5; 4: 203, 419, 286, 74, 6; 5: 877, 2183, 1945, 755, 125, 7; 6: 4140, 11990, 13084, 6740, 1695, 195, 8; 7: 21147, 69541, 89348, 57120, 19285, 3395, 287, 9; 8: 115975, 425473, 626630, 476714, 201796, 48062, 6244, 404, 10; 9: 678570, 2740482, 4538031, 3992189, 2028831, 610365, 107814, 10746, 549, 11;
%F FormulaThe row polynomials satisfy P(n,x) = (1-x-x^2)*P(n-2,x) - (x+x^2)*d/dx P(n-2,x) + (2+2*x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 5 + 3*x.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 5 + 3*x;
P[n_, x_] := P[n, x] = Expand[(1 - x - x^2)*P[n - 2, x] - (x + x^2)*D[P[n - 2, x], x] + (2 + 2*x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 5 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (1 - x - x^2)*v[i - 2] - (x + x^2)*deriv(v[i - 2], x) + (2 + 2*x)*v[i - 1] + (1 + x)*deriv(v[i - 1], x)); 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, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-0a406e2d3e1f653c -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-0a406e2d3e1f653c -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-0a406e2d3e1f653c
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
-
preserver_image affine, shift 0
e-0a406e2d3e1f653cAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 1
e-4ce9900b2631a004Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-995393ce4e49a8d6root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A008277
e-c52960bc5e97caa0Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-6e85c0971e84e272root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-ad67990681a86223Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
preserver_image reversal, shift 0
e-d527982dc7c0aa3bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-8e580efc86a38a12root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-3256729839b26765Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.
Related sequences ?
No candidate equalities or related sequences.
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.