A007318 → −D²+(−1+n)D+1+n → x ↦ x+1 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(8 + 4\,x - 20\,x^{2} + 2\,x^{3} + 4\,n + 14\,n x + 38\,n x^{2} - 9\,n x^{3} + 4\,n^{2} + 8\,n^{2} x - 2\,n^{2} x^{2} + 15\,n^{2} x^{3} + 6\,n^{3} x + 7\,n^{3} x^{2} - n^{3} x^{3} + n^{3} x^{4} + n^{4} x^{2} + n^{4} x^{3}\right)\,P_{n}(x) = \left(32 + 80\,x + 80\,x^{2} + 40\,x^{3} + 10\,x^{4} + x^{5} + 24\,n + 108\,n x + 166\,n x^{2} + 103\,n x^{3} + 28\,n x^{4} + 3\,n x^{5} + 8\,n^{2} + 56\,n^{2} x + 76\,n^{2} x^{2} + 61\,n^{2} x^{3} + 24\,n^{2} x^{4} + 3\,n^{2} x^{5} + 12\,n^{3} x + 28\,n^{3} x^{2} + 17\,n^{3} x^{3} + 5\,n^{3} x^{4} + n^{3} x^{5} + 2\,n^{4} x^{2} + 3\,n^{4} x^{3} + n^{4} x^{4}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 8 | 12 | |||||||||||||
| 2 | 14 | 56 | 27 | 97 | ||||||||||||
| 3 | 44 | 264 | 270 | 64 | 642 | |||||||||||
| 4 | 128 | 1024 | 1620 | 832 | 125 | 3729 | ||||||||||
| 5 | 352 | 3520 | 7560 | 6080 | 2000 | 216 | 19728 | |||||||||
| 6 | 928 | 11136 | 30240 | 33280 | 17250 | 4104 | 343 | 97281 | ||||||||
| 7 | 2368 | 33152 | 108864 | 152320 | 108500 | 40824 | 7546 | 512 | 454086 | |||||||
| 8 | 5888 | 94208 | 362880 | 616448 | 560000 | 290304 | 85064 | 12800 | 729 | 2028321 | ||||||
| 9 | 14336 | 258048 | 1140480 | 2279424 | 2520000 | 1669248 | 675024 | 161280 | 20412 | 1000 | 8739252 | |||||
| 10 | 34304 | 686080 | 3421440 | 7864320 | 10248000 | 8273664 | 4280640 | 1413120 | 284310 | 31000 | 1331 | 36538209 | ||||
| 11 | 80896 | 1779712 | 9884160 | 25681920 | 38544000 | 36723456 | 23181312 | 9799680 | 2726460 | 473000 | 45254 | 1728 | 148921578 | |||
| 12 | 188416 | 4521984 | 27675648 | 80199680 | 136224000 | 149630976 | 111560064 | 57581568 | 20528640 | 4928000 | 750684 | 63936 | 2197 | 593855793 | ||
| 13 | 434176 | 11288576 | 75479040 | 241319936 | 457600000 | 569327616 | 489705216 | 298721280 | 130100256 | 40040000 | 8443864 | 1145664 | 87880 | 2744 | 2323696248 | |
| 14 | 991232 | 27754496 | 201277440 | 703725568 | 1473472000 | 2047997952 | 1996490496 | 1405747200 | 723891168 | 272272000 | 73641568 | 13837824 | 1691690 | 117992 | 3375 | 8942912001 |
Compute more
?
Technical details
- Node id
n-fb8d40c1cf430e80· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-1f33a1ea2883bcf1
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: 4, 8; 2: 14, 56, 27; 3: 44, 264, 270, 64; 4: 128, 1024, 1620, 832, 125; 5: 352, 3520, 7560, 6080, 2000, 216; 6: 928, 11136, 30240, 33280, 17250, 4104, 343; 7: 2368, 33152, 108864, 152320, 108500, 40824, 7546, 512; 8: 5888, 94208, 362880, 616448, 560000, 290304, 85064, 12800, 729; 9: 14336, 258048, 1140480, 2279424, 2520000, 1669248, 675024, 161280, 20412, 1000;
%F FormulaThe row polynomials satisfy (4*n^2+4*n+8+(6*n^3+8*n^2+14*n+4)*x+(n^4+7*n^3-2*n^2+38*n-20)*x^2+(n^4-n^3+15*n^2-9*n+2)*x^3+n^3*x^4)*P(n,x) = (8*n^2+24*n+32+(12*n^3+56*n^2+108*n+80)*x+(2*n^4+28*n^3+76*n^2+166*n+80)*x^2+(3*n^4+17*n^3+61*n^2+103*n+40)*x^3+(n^4+5*n^3+24*n^2+28*n+10)*x^4+(n^3+3*n^2+3*n+1)*x^5)*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[((8*n^2 + 24*n + 32 + (12*n^3 + 56*n^2 + 108*n + 80)*x + (2*n^4 + 28*n^3 + 76*n^2 + 166*n + 80)*x^2 + (3*n^4 + 17*n^3 + 61*n^2 + 103*n + 40)*x^3 + (n^4 + 5*n^3 + 24*n^2 + 28*n + 10)*x^4 + (n^3 + 3*n^2 + 3*n + 1)*x^5)*P[n - 1, x])/(4*n^2 + 4*n + 8 + (6*n^3 + 8*n^2 + 14*n + 4)*x + (n^4 + 7*n^3 - 2*n^2 + 38*n - 20)*x^2 + (n^4 - n^3 + 15*n^2 - 9*n + 2)*x^3 + n^3*x^4)]];
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] = ((8*n^2 + 24*n + 32 + (12*n^3 + 56*n^2 + 108*n + 80)*x + (2*n^4 + 28*n^3 + 76*n^2 + 166*n + 80)*x^2 + (3*n^4 + 17*n^3 + 61*n^2 + 103*n + 40)*x^3 + (n^4 + 5*n^3 + 24*n^2 + 28*n + 10)*x^4 + (n^3 + 3*n^2 + 3*n + 1)*x^5)*v[i - 1])/(4*n^2 + 4*n + 8 + (6*n^3 + 8*n^2 + 14*n + 4)*x + (n^4 + 7*n^3 - 2*n^2 + 38*n - 20)*x^2 + (n^4 - n^3 + 15*n^2 - 9*n + 2)*x^3 + n^3*x^4)); 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
shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
-
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 [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).?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
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.