A232535 → θ+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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 4 | 5 | |||||||||||||
| 2 | 1 | 16 | 9 | 26 | ||||||||||||
| 3 | 1 | 36 | 75 | 16 | 128 | |||||||||||
| 4 | 1 | 64 | 294 | 224 | 25 | 608 | ||||||||||
| 5 | 1 | 100 | 810 | 1344 | 525 | 36 | 2816 | |||||||||
| 6 | 1 | 144 | 1815 | 5280 | 4455 | 1056 | 49 | 12800 | ||||||||
| 7 | 1 | 196 | 3549 | 16016 | 23595 | 12012 | 1911 | 64 | 57344 | |||||||
| 8 | 1 | 256 | 6300 | 40768 | 92950 | 82368 | 28028 | 3200 | 81 | 253952 | ||||||
| 9 | 1 | 324 | 10404 | 91392 | 298350 | 408408 | 241332 | 58752 | 5049 | 100 | 1114112 | |||||
| 10 | 1 | 400 | 16245 | 186048 | 823650 | 1612416 | 1469650 | 620160 | 113373 | 7600 | 121 | 4849664 | ||||
| 11 | 1 | 484 | 24255 | 351120 | 2025210 | 5372136 | 6995534 | 4547840 | 1438965 | 204820 | 11011 | 144 | 20971520 | |||
| 12 | 1 | 576 | 34914 | 623392 | 4542615 | 15690048 | 27665596 | 25674624 | 12503007 | 3076480 | 350658 | 15456 | 169 | 90177536 | ||
| 13 | 1 | 676 | 48750 | 1052480 | 9455875 | 41244060 | 94645460 | 118864000 | 82573335 | 31245500 | 6150430 | 574080 | 21125 | 196 | 385875968 | |
| 14 | 1 | 784 | 66339 | 1703520 | 18500625 | 99459360 | 288111915 | 470701440 | 442285515 | 238602000 | 72177105 | 11625120 | 904995 | 28224 | 225 | 1644167168 |
Computed in your browser ?
Technical details
- Node id
n-0e8b59f661d3a692· revision 1 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-8e96d4d9e4687e70
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: 1; 1: 1, 4; 2: 1, 16, 9; 3: 1, 36, 75, 16; 4: 1, 64, 294, 224, 25; 5: 1, 100, 810, 1344, 525, 36; 6: 1, 144, 1815, 5280, 4455, 1056, 49; 7: 1, 196, 3549, 16016, 23595, 12012, 1911, 64; 8: 1, 256, 6300, 40768, 92950, 82368, 28028, 3200, 81; 9: 1, 324, 10404, 91392, 298350, 408408, 241332, 58752, 5049, 100;
%F FormulaThe row polynomials satisfy (12*n-9-(8*n^3-6*n^2+n+3)*x+(2*n^3+n^2)*x^2)*P(n,x) = (12*n-9-(8*n^3-6*n^2-71*n+63)*x-(22*n^3+11*n^2-23*n+11)*x^2+(6*n^3+9*n^2-2*n-1)*x^3)*P(n-1,x) + (24*x-(16*n^2+24*n+22)*x^2+(20*n^2+32*n)*x^3-(4*n^2+8*n+2)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((12*n - 9 - (8*n^3 - 6*n^2 - 71*n + 63)*x - (22*n^3 + 11*n^2 - 23*n + 11)*x^2 + (6*n^3 + 9*n^2 - 2*n - 1)*x^3)*P[n - 1, x] + (24*x - (16*n^2 + 24*n + 22)*x^2 + (20*n^2 + 32*n)*x^3 - (4*n^2 + 8*n + 2)*x^4)*D[P[n - 1, x], x])/(12*n - 9 - (8*n^3 - 6*n^2 + n + 3)*x + (2*n^3 + n^2)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((12*n - 9 - (8*n^3 - 6*n^2 - 71*n + 63)*x - (22*n^3 + 11*n^2 - 23*n + 11)*x^2 + (6*n^3 + 9*n^2 - 2*n - 1)*x^3)*v[i - 1] + (24*x - (16*n^2 + 24*n + 22)*x^2 + (20*n^2 + 32*n)*x^3 - (4*n^2 + 8*n + 2)*x^4)*deriv(v[i - 1], x))/(12*n - 9 - (8*n^3 - 6*n^2 + n + 3)*x + (2*n^3 + n^2)*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, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-e1b53362b0fdfcb4 -
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-e1b53362b0fdfcb4 -
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-e1b53362b0fdfcb4 -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-e1b53362b0fdfcb4
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-e1b53362b0fdfcb4Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-a75bd3d9d36c6f35root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.
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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023