A007318 → −D²+(−1+n)D+1+n → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-12\,n - 14\,n^{2} + 12\,n^{3} + 7\,n^{4} - 6\,n^{5} + n^{6}\right)\,P_{n}(x) = \left(24 + 72\,x + 72\,x^{2} + 24\,x^{3} - 8\,n^{2} - 24\,n^{2} x - 24\,n^{2} x^{2} - 8\,n^{2} x^{3} + 15\,n^{3} + 45\,n^{3} x + 45\,n^{3} x^{2} + 15\,n^{3} x^{3} - 5\,n^{4} - 15\,n^{4} x - 15\,n^{4} x^{2} - 5\,n^{4} x^{3} - 3\,n^{5} - 9\,n^{5} x - 9\,n^{5} x^{2} - 3\,n^{5} x^{3} + n^{6} + 3\,n^{6} x + 3\,n^{6} x^{2} + n^{6} x^{3}\right)\,P_{n-3}(x) + \left(12 + 48\,x + 72\,x^{2} + 48\,x^{3} + 12\,x^{4} + 6\,n + 24\,n x + 36\,n x^{2} + 24\,n x^{3} + 6\,n x^{4} - 6\,n^{2} - 24\,n^{2} x - 36\,n^{2} x^{2} - 24\,n^{2} x^{3} - 6\,n^{2} x^{4}\right)\,P_{n-3}'(x) + \left(36\,n + 72\,n x + 36\,n x^{2} + 6\,n^{2} + 12\,n^{2} x + 6\,n^{2} x^{2} - 60\,n^{3} - 120\,n^{3} x - 60\,n^{3} x^{2} + 9\,n^{4} + 18\,n^{4} x + 9\,n^{4} x^{2} + 12\,n^{5} + 24\,n^{5} x + 12\,n^{5} x^{2} - 3\,n^{6} - 6\,n^{6} x - 3\,n^{6} x^{2}\right)\,P_{n-2}(x) + \left(-24 - 72\,x - 72\,x^{2} - 24\,x^{3} - 24\,n - 72\,n x - 72\,n x^{2} - 24\,n x^{3} + 12\,n^{2} + 36\,n^{2} x + 36\,n^{2} x^{2} + 12\,n^{2} x^{3}\right)\,P_{n-2}'(x) + \left(-72\,n - 72\,n x - 30\,n^{2} - 30\,n^{2} x + 63\,n^{3} + 63\,n^{3} x + 3\,n^{4} + 3\,n^{4} x - 15\,n^{5} - 15\,n^{5} x + 3\,n^{6} + 3\,n^{6} x\right)\,P_{n-1}(x) + \left(18\,n + 36\,n x + 18\,n x^{2} - 6\,n^{2} - 12\,n^{2} x - 6\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 4\,x\)
\(P_{2}(x) = 3 + 16\,x + 9\,x^{2}\)
\(P_{3}(x) = 4 + 36\,x + 54\,x^{2} + 16\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 4 | 6 | ||||||
| 2 | 3 | 16 | 9 | 28 | |||||
| 3 | 4 | 36 | 54 | 16 | 110 | ||||
| 4 | 5 | 64 | 162 | 128 | 25 | 384 | |||
| 5 | 6 | 100 | 360 | 480 | 250 | 36 | 1232 | ||
| 6 | 7 | 144 | 675 | 1280 | 1125 | 432 | 49 | 3712 | |
| 7 | 8 | 196 | 1134 | 2800 | 3500 | 2268 | 686 | 64 | 10656 |
Compute more
?
Technical details
- Node id
n-48ef4a5e7cd19d2a· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-329289f0f6a2a0c6
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 4; 2: 3, 16, 9; 3: 4, 36, 54, 16; 4: 5, 64, 162, 128, 25; 5: 6, 100, 360, 480, 250, 36; 6: 7, 144, 675, 1280, 1125, 432, 49; 7: 8, 196, 1134, 2800, 3500, 2268, 686, 64; 8: 9, 256, 1764, 5376, 8750, 8064, 4116, 1024, 81; 9: 10, 324, 2592, 9408, 18900, 22680, 16464, 6912, 1458, 100;
%F FormulaThe row polynomials satisfy (n^6-6*n^5+7*n^4+12*n^3-14*n^2-12*n)*P(n,x) = (n^6-3*n^5-5*n^4+15*n^3-8*n^2+24+(3*n^6-9*n^5-15*n^4+45*n^3-24*n^2+72)*x+(3*n^6-9*n^5-15*n^4+45*n^3-24*n^2+72)*x^2+(n^6-3*n^5-5*n^4+15*n^3-8*n^2+24)*x^3)*P(n-3,x) - (6*n^2-6*n-12+(24*n^2-24*n-48)*x+(36*n^2-36*n-72)*x^2+(24*n^2-24*n-48)*x^3+(6*n^2-6*n-12)*x^4)*d/dx P(n-3,x) - (3*n^6-12*n^5-9*n^4+60*n^3-6*n^2-36*n+(6*n^6-24*n^5-18*n^4+120*n^3-12*n^2-72*n)*x+(3*n^6-12*n^5-9*n^4+60*n^3-6*n^2-36*n)*x^2)*P(n-2,x) + (12*n^2-24*n-24+(36*n^2-72*n-72)*x+(36*n^2-72*n-72)*x^2+(12*n^2-24*n-24)*x^3)*d/dx P(n-2,x) + (3*n^6-15*n^5+3*n^4+63*n^3-30*n^2-72*n+(3*n^6-15*n^5+3*n^4+63*n^3-30*n^2-72*n)*x)*P(n-1,x) - (6*n^2-18*n+(12*n^2-36*n)*x+(6*n^2-18*n)*x^2)*d/dx P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + 4*x, P(2,x) = 3 + 16*x + 9*x^2, P(3,x) = 4 + 36*x + 54*x^2 + 16*x^3.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[2, x_] := 3 + 16*x + 9*x^2;
P[3, x_] := 4 + 36*x + 54*x^2 + 16*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n^6 - 3*n^5 - 5*n^4 + 15*n^3 - 8*n^2 + 24 + (3*n^6 - 9*n^5 - 15*n^4 + 45*n^3 - 24*n^2 + 72)*x + (3*n^6 - 9*n^5 - 15*n^4 + 45*n^3 - 24*n^2 + 72)*x^2 + (n^6 - 3*n^5 - 5*n^4 + 15*n^3 - 8*n^2 + 24)*x^3)*P[n - 3, x] - (6*n^2 - 6*n - 12 + (24*n^2 - 24*n - 48)*x + (36*n^2 - 36*n - 72)*x^2 + (24*n^2 - 24*n - 48)*x^3 + (6*n^2 - 6*n - 12)*x^4)*D[P[n - 3, x], x] - (3*n^6 - 12*n^5 - 9*n^4 + 60*n^3 - 6*n^2 - 36*n + (6*n^6 - 24*n^5 - 18*n^4 + 120*n^3 - 12*n^2 - 72*n)*x + (3*n^6 - 12*n^5 - 9*n^4 + 60*n^3 - 6*n^2 - 36*n)*x^2)*P[n - 2, x] + (12*n^2 - 24*n - 24 + (36*n^2 - 72*n - 72)*x + (36*n^2 - 72*n - 72)*x^2 + (12*n^2 - 24*n - 24)*x^3)*D[P[n - 2, x], x] + (3*n^6 - 15*n^5 + 3*n^4 + 63*n^3 - 30*n^2 - 72*n + (3*n^6 - 15*n^5 + 3*n^4 + 63*n^3 - 30*n^2 - 72*n)*x)*P[n - 1, x] - (6*n^2 - 18*n + (12*n^2 - 36*n)*x + (6*n^2 - 18*n)*x^2)*D[P[n - 1, x], x])/(n^6 - 6*n^5 + 7*n^4 + 12*n^3 - 14*n^2 - 12*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 4*x; v[3] = 3 + 16*x + 9*x^2; v[4] = 4 + 36*x + 54*x^2 + 16*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n^6 - 3*n^5 - 5*n^4 + 15*n^3 - 8*n^2 + 24 + (3*n^6 - 9*n^5 - 15*n^4 + 45*n^3 - 24*n^2 + 72)*x + (3*n^6 - 9*n^5 - 15*n^4 + 45*n^3 - 24*n^2 + 72)*x^2 + (n^6 - 3*n^5 - 5*n^4 + 15*n^3 - 8*n^2 + 24)*x^3)*v[i - 3] - (6*n^2 - 6*n - 12 + (24*n^2 - 24*n - 48)*x + (36*n^2 - 36*n - 72)*x^2 + (24*n^2 - 24*n - 48)*x^3 + (6*n^2 - 6*n - 12)*x^4)*deriv(v[i - 3], x) - (3*n^6 - 12*n^5 - 9*n^4 + 60*n^3 - 6*n^2 - 36*n + (6*n^6 - 24*n^5 - 18*n^4 + 120*n^3 - 12*n^2 - 72*n)*x + (3*n^6 - 12*n^5 - 9*n^4 + 60*n^3 - 6*n^2 - 36*n)*x^2)*v[i - 2] + (12*n^2 - 24*n - 24 + (36*n^2 - 72*n - 72)*x + (36*n^2 - 72*n - 72)*x^2 + (12*n^2 - 24*n - 24)*x^3)*deriv(v[i - 2], x) + (3*n^6 - 15*n^5 + 3*n^4 + 63*n^3 - 30*n^2 - 72*n + (3*n^6 - 15*n^5 + 3*n^4 + 63*n^3 - 30*n^2 - 72*n)*x)*v[i - 1] - (6*n^2 - 18*n + (12*n^2 - 36*n)*x + (6*n^2 - 18*n)*x^2)*deriv(v[i - 1], x))/(n^6 - 6*n^5 + 7*n^4 + 12*n^3 - 14*n^2 - 12*n)); 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
Related ?
Candidate equalities ?
- A093375 → (θ+1)² 15 rows; no all-index equality certificate was found
Same fingerprint ?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.