A143495 → x ↦ x+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + 2\,x - 2\,x^{2} + n x + n x^{2}\right)\,P_{n-1}(x) + \left(-x^{2} - x^{3}\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 | 1 | 4 | 5 | |||||||||||||
| 3 | 1 | 9 | 17 | 27 | ||||||||||||
| 4 | 1 | 15 | 64 | 77 | 157 | |||||||||||
| 5 | 1 | 22 | 157 | 427 | 372 | 979 | ||||||||||
| 6 | 1 | 30 | 315 | 1435 | 2821 | 1915 | 6517 | |||||||||
| 7 | 1 | 39 | 560 | 3760 | 12376 | 18890 | 10481 | 46107 | ||||||||
| 8 | 1 | 49 | 917 | 8435 | 40936 | 104426 | 129683 | 60814 | 345261 | |||||||
| 9 | 1 | 60 | 1414 | 16982 | 113001 | 424718 | 879047 | 918081 | 372939 | 2726243 | ||||||
| 10 | 1 | 72 | 2082 | 31542 | 274323 | 1413636 | 4304077 | 7466517 | 6721438 | 2409837 | 22623525 | |||||
| 11 | 1 | 85 | 2955 | 55020 | 604317 | 4071795 | 16984780 | 43249600 | 64432771 | 50950061 | 16360786 | 196712171 | ||||
| 12 | 1 | 99 | 4070 | 91245 | 1233177 | 10500105 | 57256837 | 199486815 | 435119091 | 567295487 | 399976633 | 116393205 | 1787356765 | |||
| 13 | 1 | 114 | 5467 | 145145 | 2364747 | 24795012 | 170890126 | 777798978 | 2317297796 | 4411076384 | 5109106828 | 3250867344 | 865549453 | 16929897395 | ||
| 14 | 1 | 130 | 7189 | 222937 | 4306302 | 54478281 | 462553234 | 2660265322 | 10342829354 | 26838453642 | 45255832700 | 47138737464 | 27338099829 | 6713065156 | 166808851541 | |
| 15 | 1 | 147 | 9282 | 332332 | 7506499 | 112689577 | 1155049324 | 8184177144 | 40183355212 | 135885509760 | 311677608606 | 471283380932 | 445938022713 | 237681039229 | 54190360453 | 1706299041211 |
Compute more
?
Technical details
- Node id
n-33a4ac1ca078a4fe· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-adf2adbefbd3f634
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: 1, 4; 3: 1, 9, 17; 4: 1, 15, 64, 77; 5: 1, 22, 157, 427, 372; 6: 1, 30, 315, 1435, 2821, 1915; 7: 1, 39, 560, 3760, 12376, 18890, 10481; 8: 1, 49, 917, 8435, 40936, 104426, 129683, 60814; 9: 1, 60, 1414, 16982, 113001, 424718, 879047, 918081, 372939; 10: 1, 72, 2082, 31542, 274323, 1413636, 4304077, 7466517, 6721438, 2409837;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(n+2)*x+(n-2)*x^2)*P(n-1,x) - (x^2+x^3)*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[(1 + (n + 2)*x + (n - 2)*x^2)*P[n - 1, x] - (x^2 + x^3)*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; for(n = 2, N, my(i = n); v[i] = (1 + (n + 2)*x + (n - 2)*x^2)*v[i - 1] - (x^2 + x^3)*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 (−∞, 0]
- 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
shift_x_plus_one of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Liu–Wang theorem (above)
-
Laguerre’s theorem on differential operators [SP14] 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.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
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
veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).?
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
shift_x_plus_one of basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 2-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Ray basis map theorem (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
-
from
reversal of Triangle read by rows: 3-Stirling numbers of the second kind.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: 3-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
shift_x_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
shift_x_plus_one of 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 ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
-
from
shift_x_plus_one of Triangle read by rows: 2-Stirling numbers of the second kind.?
-
-
from
shift_x_plus_one of Triangle read by rows: 3-Stirling numbers of the second kind.?
Related ?
Candidate equalities ?
- A143495 → reverse → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
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.