A144436 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 4\,x\right)\,P_{n-2}(x) + \left(1 + n + n x\right)\,P_{n-1}(x) + \left(-x - x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 1 | 3 | |||||||||||||
| 2 | 10 | 10 | 1 | 21 | ||||||||||||
| 3 | 48 | 72 | 26 | 1 | 147 | |||||||||||
| 4 | 280 | 560 | 338 | 58 | 1 | 1237 | ||||||||||
| 5 | 1872 | 4680 | 3984 | 1296 | 122 | 1 | 11955 | |||||||||
| 6 | 14224 | 42672 | 46912 | 22704 | 4490 | 250 | 1 | 131253 | ||||||||
| 7 | 121280 | 424480 | 572160 | 369200 | 114448 | 14712 | 506 | 1 | 1616787 | |||||||
| 8 | 1148416 | 4593664 | 7334816 | 5926624 | 2527016 | 535600 | 46658 | 1018 | 1 | 22113813 | ||||||
| 9 | 11969280 | 53861760 | 99414400 | 96595520 | 52656432 | 15829720 | 2389904 | 145056 | 2042 | 1 | 332864115 | |||||
| 10 | 136255744 | 681278720 | 1427199360 | 1621125120 | 1078578224 | 423167376 | 93427152 | 10330544 | 445370 | 4090 | 1 | 5471811701 | ||||
| 11 | 1682946048 | 9256203264 | 21697885440 | 28218960000 | 22194634560 | 10786163808 | 3172445664 | 528928320 | 43692048 | 1356552 | 8186 | 1 | 97583223891 | |||
| 12 | 22423321600 | 134539929600 | 348928888064 | 511361752320 | 464521164416 | 269853369344 | 99776644416 | 22623274688 | 2906205496 | 181992240 | 4110578 | 16378 | 1 | 1877120669141 | ||
| 13 | 320658286592 | 2084278862848 | 5925442166784 | 9662864425984 | 9960483545600 | 6741293997312 | 3012874547968 | 871604929664 | 155467362576 | 15621183080 | 749870224 | 12413616 | 32762 | 1 | 38751351625011 | |
| 14 | 4899567585280 | 34296973096960 | 106060248655872 | 190500841674752 | 219760359354368 | 169955273564160 | 89266036962560 | 31565435497472 | 7291623966416 | 1038884064880 | 82599677792 | 3065643184 | 37404650 | 65530 | 1 | 854720947213877 |
Compute more
?
Technical details
- Node id
n-889768c2c30f1bc9· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-1c1d701204aa53d8
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, 1; 2: 10, 10, 1; 3: 48, 72, 26, 1; 4: 280, 560, 338, 58, 1; 5: 1872, 4680, 3984, 1296, 122, 1; 6: 14224, 42672, 46912, 22704, 4490, 250, 1; 7: 121280, 424480, 572160, 369200, 114448, 14712, 506, 1; 8: 1148416, 4593664, 7334816, 5926624, 2527016, 535600, 46658, 1018, 1; 9: 11969280, 53861760, 99414400, 96595520, 52656432, 15829720, 2389904, 145056, 2042, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (4+4*x)*P(n-2,x) + (n+1+n*x)*P(n-1,x) - (x+x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[(4 + 4*x)*P[n - 2, x] + (n + 1 + n*x)*P[n - 1, x] - (x + x^2)*D[P[n - 1, x], x]];
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 + x; for(n = 2, N, my(i = n + 1); v[i] = (4 + 4*x)*v[i - 2] + (n + 1 + n*x)*v[i - 1] - (x + x^2)*deriv(v[i - 1], x)); 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m …?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
from
Triangle T(n, k) = (m*(n-k) + 1)*T(n-1, k-1) + (m*(k-1) + 1)*T(n-1, k) + j*T(n-2, k-1), where T(n, 1) = T(n, n) = 1, m …?
Related ?
Same fingerprint ?
References
- [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