A008277 → θ+1 → D+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(4\right)\,P_{n}(x) = \left(16 + 6\,x - 6\,x^{2} + 4\,x^{3}\right)\,P_{n-3}(x) + \left(3 - x - 9\,x^{2}\right)\,P_{n-3}'(x) + \left(x - 3\,x^{2} - 4\,x^{3}\right)\,P_{n-3}''(x) + \left(-30 - 12\,x - 12\,x^{2}\right)\,P_{n-2}(x) + \left(-4 + 4\,x\right)\,P_{n-2}'(x) + \left(-x + 4\,x^{2}\right)\,P_{n-2}''(x) + \left(18 + 12\,x\right)\,P_{n-1}(x) + \left(1\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + 4\,x\)
\(P_{3}(x) = 7 + 24\,x + 9\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 4 | 7 | |||||||||||||
| 3 | 7 | 24 | 9 | 40 | ||||||||||||
| 4 | 15 | 100 | 90 | 16 | 221 | |||||||||||
| 5 | 31 | 360 | 585 | 240 | 25 | 1241 | ||||||||||
| 6 | 63 | 1204 | 3150 | 2240 | 525 | 36 | 7218 | |||||||||
| 7 | 127 | 3864 | 15309 | 16800 | 6650 | 1008 | 49 | 43807 | ||||||||
| 8 | 255 | 12100 | 69930 | 111216 | 66150 | 16632 | 1764 | 64 | 278111 | |||||||
| 9 | 511 | 37320 | 306945 | 680400 | 570675 | 211680 | 36750 | 2880 | 81 | 1847242 | ||||||
| 10 | 1023 | 114004 | 1311750 | 3947680 | 4487175 | 2303532 | 582120 | 73920 | 4455 | 100 | 12825759 | |||||
| 11 | 2047 | 346104 | 5503509 | 22070400 | 33091300 | 22586256 | 7792323 | 1425600 | 138105 | 6600 | 121 | 92962365 | ||||
| 12 | 4095 | 1046500 | 22792770 | 120136016 | 233032800 | 205755264 | 93080988 | 23008128 | 3185325 | 243100 | 9438 | 144 | 702294568 | |||
| 13 | 8191 | 3155880 | 93525705 | 641200560 | 1585909325 | 1775854080 | 1024703680 | 328648320 | 60972912 | 6606600 | 407407 | 13104 | 169 | 5521005933 | ||
| 14 | 16383 | 9500404 | 381203550 | 3372270720 | 10517331825 | 14714687988 | 10614764160 | 4296223360 | 1025674650 | 147947800 | 12882870 | 655200 | 17745 | 196 | 45093176851 | |
| 15 | 32767 | 28566744 | 1546190109 | 17539048800 | 68373163950 | 118147773744 | 104946438597 | 52530192000 | 15694154190 | 2893690800 | 333611278 | 23849280 | 1017380 | 23520 | 225 | 382057753384 |
Compute more
?
Technical details
- Node id
n-d15b68a7dc3afe9f· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-44fef67f8d84e135
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: 3, 4; 3: 7, 24, 9; 4: 15, 100, 90, 16; 5: 31, 360, 585, 240, 25; 6: 63, 1204, 3150, 2240, 525, 36; 7: 127, 3864, 15309, 16800, 6650, 1008, 49; 8: 255, 12100, 69930, 111216, 66150, 16632, 1764, 64; 9: 511, 37320, 306945, 680400, 570675, 211680, 36750, 2880, 81; 10: 1023, 114004, 1311750, 3947680, 4487175, 2303532, 582120, 73920, 4455, 100;
%F FormulaThe row polynomials satisfy 4*P(n,x) = (16+6*x-6*x^2+4*x^3)*P(n-3,x) + (3-x-9*x^2)*d/dx P(n-3,x) + (x-3*x^2-4*x^3)*d^2/dx^2 P(n-3,x) - (30+12*x+12*x^2)*P(n-2,x) - (4-4*x)*d/dx P(n-2,x) - (x-4*x^2)*d^2/dx^2 P(n-2,x) + (18+12*x)*P(n-1,x) + d/dx P(n-1,x) for n >= 4, with P(1,x) = 1, P(2,x) = 3 + 4*x, P(3,x) = 7 + 24*x + 9*x^2.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 3 + 4*x;
P[3, x_] := 7 + 24*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((16 + 6*x - 6*x^2 + 4*x^3)*P[n - 3, x] + (3 - x - 9*x^2)*D[P[n - 3, x], x] + (x - 3*x^2 - 4*x^3)*D[P[n - 3, x], {x, 2}] - (30 + 12*x + 12*x^2)*P[n - 2, x] - (4 - 4*x)*D[P[n - 2, x], x] - (x - 4*x^2)*D[P[n - 2, x], {x, 2}] + (18 + 12*x)*P[n - 1, x] + D[P[n - 1, x], x])/(4)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + 4*x; v[3] = 7 + 24*x + 9*x^2; for(n = 4, N, my(i = n); v[i] = ((16 + 6*x - 6*x^2 + 4*x^3)*v[i - 3] + (3 - x - 9*x^2)*deriv(v[i - 3], x) + (x - 3*x^2 - 4*x^3)*deriv(deriv(v[i - 3], x), x) - (30 + 12*x + 12*x^2)*v[i - 2] - (4 - 4*x)*deriv(v[i - 2], x) - (x - 4*x^2)*deriv(deriv(v[i - 2], x), x) + (18 + 12*x)*v[i - 1] + deriv(v[i - 1], x))/(4)); 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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
one_plus_derivative of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of eulerian?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of eulerian?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
-
from
one_plus_derivative of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling…?
Related ?
Same fingerprint ?
References
- [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
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.