A143494 → (θ+1)²
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 4 | 6 | ||||||
| 3 | 4 | 20 | 9 | 33 | |||||
| 4 | 8 | 76 | 81 | 16 | 181 | ||||
| 5 | 16 | 260 | 495 | 224 | 25 | 1020 | |||
| 6 | 32 | 844 | 2565 | 2000 | 500 | 36 | 5977 | ||
| 7 | 64 | 2660 | 12159 | 14560 | 6125 | 972 | 49 | 36589 | |
| 8 | 128 | 8236 | 54621 | 94416 | 59500 | 15624 | 1715 | 64 | 234304 |
Computed in your browser ?
Technical details
- Node id
n-2f1b1470f7e407ab· revision 1 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-fefd2b9ccc27c8c7
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 4; 3: 4, 20, 9; 4: 8, 76, 81, 16; 5: 16, 260, 495, 224, 25; 6: 32, 844, 2565, 2000, 500, 36; 7: 64, 2660, 12159, 14560, 6125, 972, 49; 8: 128, 8236, 54621, 94416, 59500, 15624, 1715, 64; 9: 256, 25220, 237015, 569184, 504525, 195048, 34986, 2816, 81; 10: 512, 76684, 1004805, 3267280, 3916500, 2091852, 545370, 71040, 4374, 100;
%F FormulaThe row polynomials satisfy P(n,x) = -(2+8*x-9*x^2)*P(n-2,x) - (4*x-8*x^2-4*x^3)*d/dx P(n-2,x) - (x^2-4*x^3)*d^2/dx^2 P(n-2,x) + (3+4*x)*P(n-1,x) + (2*x-4*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + 4*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(2 + 8*x - 9*x^2)*P[n - 2, x] - (4*x - 8*x^2 - 4*x^3)*D[P[n - 2, x], x] - (x^2 - 4*x^3)*D[P[n - 2, x], {x, 2}] + (3 + 4*x)*P[n - 1, x] + (2*x - 4*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 4*x; for(n = 3, N, my(i = n); v[i] = -(2 + 8*x - 9*x^2)*v[i - 2] - (4*x - 8*x^2 - 4*x^3)*deriv(v[i - 2], x) - (x^2 - 4*x^3)*deriv(deriv(v[i - 2], x), x) + (3 + 4*x)*v[i - 1] + (2*x - 4*x^2)*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, v[i])))};
T(10)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-9153f4bdcc1bfc1a -
Coefficients of one sign. Every nonzero row, n >= 1: 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-9153f4bdcc1bfc1a -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-9153f4bdcc1bfc1a -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-9153f4bdcc1bfc1a
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 euler_polynomial, shift 0
e-9153f4bdcc1bfc1aLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle read by rows: 2-Stirling numbers of the second kind.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-d198e25506383784root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image derivative_polynomial, shift 0
e-34c9c7195bdd20aaLaguerre’s theorem on differential operators [SP14] 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 read by rows: 2-Stirling numbers of the second kind.
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.