A063007 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-3 + x + x^{2} + 6\,n - n x - n x^{2} - 4\,n^{2} + n^{3}\right)\,P_{n}(x) = \left(1 + 7\,x + 7\,x^{2} + 2\,x^{3} + 2\,n - 5\,n x - 7\,n x^{2} - 2\,n x^{3} - 6\,n^{2} - 4\,n^{2} x + 3\,n^{3} + 2\,n^{3} x\right)\,P_{n-1}(x) + \left(-4 - 18\,x - 24\,x^{2} - 12\,x^{3} - 2\,x^{4} - 8\,n - 12\,n x - 4\,n x^{2} + 4\,n^{2} + 6\,n^{2} x + 2\,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 | 5 | 2 | 7 | |||||||||||||
| 3 | 31 | 30 | 6 | 67 | ||||||||||||
| 4 | 195 | 312 | 150 | 20 | 677 | |||||||||||
| 5 | 1221 | 2760 | 2190 | 700 | 70 | 6941 | ||||||||||
| 6 | 7593 | 22290 | 24990 | 13160 | 3150 | 252 | 71435 | |||||||||
| 7 | 46915 | 169806 | 247380 | 183960 | 72450 | 13860 | 924 | 735295 | ||||||||
| 8 | 288263 | 1242080 | 2232468 | 2157120 | 1198890 | 376992 | 60060 | 3432 | 7559305 | |||||||
| 9 | 1762825 | 8817696 | 18878580 | 22508640 | 16250850 | 7207200 | 1885884 | 257400 | 12870 | 77581945 | ||||||
| 10 | 10736973 | 61178130 | 152133300 | 216114360 | 192522330 | 110882772 | 40900860 | 9163440 | 1093950 | 48620 | 794774735 | |||||
| 11 | 65171943 | 416822670 | 1181263050 | 1949530440 | 2069337270 | 1470376908 | 704143440 | 222290640 | 43539210 | 4618900 | 184756 | 8127279227 | ||||
| 12 | 394414155 | 2798399736 | 8905409370 | 16753797060 | 20662591950 | 17493315840 | 10333539216 | 4234024080 | 1168119810 | 203231600 | 19399380 | 705432 | 82966947629 | |||
| 13 | 2380819533 | 18559873800 | 65544456978 | 138499140780 | 194738003460 | 191566222848 | 134819564880 | 68128405488 | 24389177670 | 5975009040 | 935050116 | 81124680 | 2704156 | 845619553429 | ||
| 14 | 14339099505 | 121839376386 | 472902254370 | 1109161413360 | 1751901851700 | 1964873350440 | 1606718729616 | 967230916080 | 426970654110 | 135698663100 | 29894444580 | 4250933232 | 338019500 | 10400600 | 8606130106579 | |
| 15 | 86189487243 | 792871247070 | 3355207619400 | 8650739719440 | 15168417083820 | 19112106221208 | 17818679718840 | 12462815748240 | 6553197861210 | 2567798933700 | 733707830856 | 146835670800 | 19131903700 | 1404081000 | 40116600 | 87469143243127 |
Compute more
?
Technical details
- Node id
n-ce137bd5ab0d5fca· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-933bf7e3a34d1923
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: 5, 2; 3: 31, 30, 6; 4: 195, 312, 150, 20; 5: 1221, 2760, 2190, 700, 70; 6: 7593, 22290, 24990, 13160, 3150, 252; 7: 46915, 169806, 247380, 183960, 72450, 13860, 924; 8: 288263, 1242080, 2232468, 2157120, 1198890, 376992, 60060, 3432; 9: 1762825, 8817696, 18878580, 22508640, 16250850, 7207200, 1885884, 257400, 12870; 10: 10736973, 61178130, 152133300, 216114360, 192522330, 110882772, 40900860, 9163440, 1093950, 48620;
%F FormulaThe row polynomials satisfy (n^3-4*n^2+6*n-3-(n-1)*x-(n-1)*x^2)*P(n,x) = (3*n^3-6*n^2+2*n+1+(2*n^3-4*n^2-5*n+7)*x-(7*n-7)*x^2-(2*n-2)*x^3)*P(n-1,x) + (4*n^2-8*n-4+(6*n^2-12*n-18)*x+(2*n^2-4*n-24)*x^2-12*x^3-2*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[((3*n^3 - 6*n^2 + 2*n + 1 + (2*n^3 - 4*n^2 - 5*n + 7)*x - (7*n - 7)*x^2 - (2*n - 2)*x^3)*P[n - 1, x] + (4*n^2 - 8*n - 4 + (6*n^2 - 12*n - 18)*x + (2*n^2 - 4*n - 24)*x^2 - 12*x^3 - 2*x^4)*D[P[n - 1, x], x])/(n^3 - 4*n^2 + 6*n - 3 - (n - 1)*x - (n - 1)*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] = ((3*n^3 - 6*n^2 + 2*n + 1 + (2*n^3 - 4*n^2 - 5*n + 7)*x - (7*n - 7)*x^2 - (2*n - 2)*x^3)*v[i - 1] + (4*n^2 - 8*n - 4 + (6*n^2 - 12*n - 18)*x + (2*n^2 - 4*n - 24)*x^2 - 12*x^3 - 2*x^4)*deriv(v[i - 1], x))/(n^3 - 4*n^2 + 6*n - 3 - (n - 1)*x - (n - 1)*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_A007318 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_A007318 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