A063007 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-6 - x + 2\,x^{2} + 12\,n + n x - 2\,n x^{2} - 8\,n^{2} + 2\,n^{3}\right)\,P_{n}(x) = \left(-2 + x + 10\,x^{2} + 8\,x^{3} + 8\,n + 7\,n x - 10\,n x^{2} - 8\,n x^{3} - 12\,n^{2} - 16\,n^{2} x + 6\,n^{3} + 8\,n^{3} x\right)\,P_{n-1}(x) + \left(2 - 18\,x^{2} - 24\,x^{3} - 8\,x^{4} - 8\,n - 24\,n x - 16\,n x^{2} + 4\,n^{2} + 12\,n^{2} x + 8\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 7 | 4 | 11 | |||||||||||||
| 3 | 49 | 84 | 24 | 157 | ||||||||||||
| 4 | 327 | 984 | 840 | 160 | 2311 | |||||||||||
| 5 | 2121 | 9240 | 13800 | 7840 | 1120 | 34121 | ||||||||||
| 6 | 13503 | 77340 | 167160 | 165760 | 70560 | 8064 | 502387 | |||||||||
| 7 | 84841 | 603372 | 1715280 | 2459520 | 1824480 | 620928 | 59136 | 7367557 | ||||||||
| 8 | 527887 | 4489072 | 15854832 | 29897280 | 32044320 | 18982656 | 5381376 | 439296 | 107616719 | |||||||
| 9 | 3259921 | 32276592 | 136387440 | 319556160 | 450283680 | 385152768 | 189885696 | 46126080 | 3294720 | 1566223057 | ||||||
| 10 | 20011383 | 226163700 | 1113258960 | 3121345920 | 5464499040 | 6142840704 | 4370446080 | 1845043200 | 392071680 | 24893440 | 22720574107 | |||||
| 11 | 122246433 | 1553141700 | 8730608040 | 28522116480 | 59755856160 | 83445538176 | 77999201280 | 47496683520 | 17531205120 | 3310827520 | 189190144 | 328656614573 | ||||
| 12 | 743781591 | 10494864072 | 66345210360 | 247578371040 | 604428945120 | 1010041224192 | 1172607980544 | 937835458560 | 499107248640 | 163649474560 | 27810951168 | 1444724736 | 4742088234583 | |||
| 13 | 4510043097 | 69981048072 | 491494355352 | 2063108567520 | 5754058390080 | 11204938128384 | 15565297972224 | 15458915856384 | 10802638978560 | 5105296035840 | 1505764356096 | 232600682496 | 11076222976 | 68269680637081 | ||
| 14 | 27268265391 | 461499173772 | 3565397613960 | 16630723549440 | 52182143133120 | 116091209025792 | 187921576786944 | 223299235061760 | 193735555453440 | 120192971458560 | 51080771309568 | 13690211598336 | 1938339020800 | 85201715200 | 980902103166083 | |
| 15 | 164455126233 | 3014953710300 | 25412449739040 | 130417422670080 | 454783594224960 | 1138339229803776 | 2105207060436480 | 2914820386283520 | 3025342312312320 | 2329931961477120 | 1299589856108544 | 501752900812800 | 123222980608000 | 16103124172800 | 657270374400 | 14068759957860373 |
Compute more
?
Technical details
- Node id
n-7529eeb526a60491· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-ef46ce37242ffd3c
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 7, 4; 3: 49, 84, 24; 4: 327, 984, 840, 160; 5: 2121, 9240, 13800, 7840, 1120; 6: 13503, 77340, 167160, 165760, 70560, 8064; 7: 84841, 603372, 1715280, 2459520, 1824480, 620928, 59136; 8: 527887, 4489072, 15854832, 29897280, 32044320, 18982656, 5381376, 439296; 9: 3259921, 32276592, 136387440, 319556160, 450283680, 385152768, 189885696, 46126080, 3294720; 10: 20011383, 226163700, 1113258960, 3121345920, 5464499040, 6142840704, 4370446080, 1845043200, 392071680, 24893440;
%F FormulaThe row polynomials satisfy (2*n^3-8*n^2+12*n-6+(n-1)*x-(2*n-2)*x^2)*P(n,x) = (6*n^3-12*n^2+8*n-2+(8*n^3-16*n^2+7*n+1)*x-(10*n-10)*x^2-(8*n-8)*x^3)*P(n-1,x) + (4*n^2-8*n+2+(12*n^2-24*n)*x+(8*n^2-16*n-18)*x^2-24*x^3-8*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((6*n^3 - 12*n^2 + 8*n - 2 + (8*n^3 - 16*n^2 + 7*n + 1)*x - (10*n - 10)*x^2 - (8*n - 8)*x^3)*P[n - 1, x] + (4*n^2 - 8*n + 2 + (12*n^2 - 24*n)*x + (8*n^2 - 16*n - 18)*x^2 - 24*x^3 - 8*x^4)*D[P[n - 1, x], x])/(2*n^3 - 8*n^2 + 12*n - 6 + (n - 1)*x - (2*n - 2)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((6*n^3 - 12*n^2 + 8*n - 2 + (8*n^3 - 16*n^2 + 7*n + 1)*x - (10*n - 10)*x^2 - (8*n - 8)*x^3)*v[i - 1] + (4*n^2 - 8*n + 2 + (12*n^2 - 24*n)*x + (8*n^2 - 16*n - 18)*x^2 - 24*x^3 - 8*x^4)*deriv(v[i - 1], x))/(2*n^3 - 8*n^2 + 12*n - 6 + (n - 1)*x - (2*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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
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
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
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) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
-
from
basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
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.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023