A008277 → θ+1 → reverse → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2 + 3\,x - n - n x\right)\,P_{n-2}(x) + \left(1 + 2\,x + x^{2}\right)\,P_{n-2}'(x) + \left(1 - x + n + n x\right)\,P_{n-1}(x) + \left(-1 - 2\,x - x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 1 | 4 | |||||||||||||
| 3 | 10 | 8 | 1 | 19 | ||||||||||||
| 4 | 37 | 49 | 17 | 1 | 104 | |||||||||||
| 5 | 151 | 284 | 171 | 34 | 1 | 641 | ||||||||||
| 6 | 674 | 1658 | 1452 | 528 | 67 | 1 | 4380 | |||||||||
| 7 | 3263 | 9974 | 11593 | 6292 | 1548 | 132 | 1 | 32803 | ||||||||
| 8 | 17007 | 62375 | 90981 | 66561 | 25139 | 4443 | 261 | 1 | 266768 | |||||||
| 9 | 94828 | 406832 | 717055 | 665102 | 344200 | 96296 | 12673 | 518 | 1 | 2337505 | ||||||
| 10 | 562595 | 2769493 | 5740244 | 6480624 | 4297703 | 1676293 | 361050 | 36202 | 1031 | 1 | 21925236 | |||||
| 11 | 3535027 | 19668054 | 46967724 | 62694048 | 50985485 | 25768038 | 7880808 | 1340800 | 103962 | 2056 | 1 | 218946003 | ||||
| 12 | 23430840 | 145559632 | 394152376 | 608712520 | 588541934 | 367595446 | 147373778 | 36301450 | 4966601 | 300573 | 4105 | 1 | 2316939256 | |||
| 13 | 163254885 | 1121153604 | 3398837742 | 5971786092 | 6708712453 | 5010078488 | 2502231746 | 817840724 | 165384805 | 18429540 | 875031 | 8202 | 1 | 25878593313 | ||
| 14 | 1192059223 | 8974604065 | 30143022366 | 59452961410 | 76242564985 | 66444672279 | 39910975548 | 16385851324 | 4453159440 | 749829780 | 68684488 | 2563572 | 16395 | 1 | 304020964876 | |
| 15 | 9097183602 | 74553168520 | 275020365961 | 602319592300 | 869460489342 | 867941285624 | 611097097341 | 303561760200 | 104525307903 | 23971810990 | 3397138475 | 257483548 | 7551352 | 32780 | 1 | 3745210267939 |
Compute more
?
Technical details
- Node id
n-92978e16f285592e· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-4df902786f948216
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, 1; 3: 10, 8, 1; 4: 37, 49, 17, 1; 5: 151, 284, 171, 34, 1; 6: 674, 1658, 1452, 528, 67, 1; 7: 3263, 9974, 11593, 6292, 1548, 132, 1; 8: 17007, 62375, 90981, 66561, 25139, 4443, 261, 1; 9: 94828, 406832, 717055, 665102, 344200, 96296, 12673, 518, 1; 10: 562595, 2769493, 5740244, 6480624, 4297703, 1676293, 361050, 36202, 1031, 1;
%F FormulaThe row polynomials satisfy P(n,x) = -(n-2+(n-3)*x)*P(n-2,x) + (1+2*x+x^2)*d/dx P(n-2,x) + (n+1+(n-1)*x)*P(n-1,x) - (1+2*x+x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[-(n - 2 + (n - 3)*x)*P[n - 2, x] + (1 + 2*x + x^2)*D[P[n - 2, x], x] + (n + 1 + (n - 1)*x)*P[n - 1, x] - (1 + 2*x + x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = -(n - 2 + (n - 3)*x)*v[i - 2] + (1 + 2*x + x^2)*deriv(v[i - 2], x) + (n + 1 + (n - 1)*x)*v[i - 1] - (1 + 2*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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
Affine, reversal and Möbius substitutions (elementary) 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
reversal of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
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.