A156992 → basis A007318 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 + x + n\right)\,P_{n}(x) = \left(4 + 4\,x + x^{2} + 6\,n + 5\,n x + n x^{2} + 2\,n^{2} + n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 6 | 2 | 8 | |||||||||||||
| 2 | 48 | 36 | 6 | 90 | ||||||||||||
| 3 | 480 | 576 | 216 | 24 | 1296 | |||||||||||
| 4 | 5760 | 9600 | 5760 | 1440 | 120 | 22680 | ||||||||||
| 5 | 80640 | 172800 | 144000 | 57600 | 10800 | 720 | 466560 | |||||||||
| 6 | 1290240 | 3386880 | 3628800 | 2016000 | 604800 | 90720 | 5040 | 11022480 | ||||||||
| 7 | 23224320 | 72253440 | 94832640 | 67737600 | 28224000 | 6773760 | 846720 | 40320 | 293932800 | |||||||
| 8 | 464486400 | 1672151040 | 2601123840 | 2275983360 | 1219276800 | 406425600 | 81285120 | 8709120 | 362880 | 8729804160 | ||||||
| 9 | 10218700800 | 41803776000 | 75246796800 | 78033715200 | 51209625600 | 21946982400 | 6096384000 | 1045094400 | 97977600 | 3628800 | 285702681600 | |||||
| 10 | 245248819200 | 1124057088000 | 2299207680000 | 2759049216000 | 2145927168000 | 1126611763200 | 402361344000 | 95800320000 | 14370048000 | 1197504000 | 39916800 | 10213870867200 | ||||
| 11 | 6376469299200 | 32372844134400 | 74187767808000 | 101165137920000 | 91048624128000 | 56652477235200 | 24785458790400 | 7587385344000 | 1580705280000 | 210760704000 | 15807052800 | 479001600 | 395983916697600 | |||
| 12 | 178541140377600 | 994729210675200 | 2525081842483200 | 3857763926016000 | 3945440378880000 | 2840717072793600 | 1472964408115200 | 552361653043200 | 147954014208000 | 27398891520000 | 3287866982400 | 224172748800 | 6227020800 | 16546470804864000 | ||
| 13 | 5356234211328000 | 32494487548723200 | 90520358171443200 | 153188298443980800 | 175528258633728000 | 143614029791232000 | 86168417874739200 | 38297074610995200 | 12566227606732800 | 2991958953984000 | 498659825664000 | 54399253708800 | 3399953356800 | 87178291200 | 741281892057907200 | |
| 14 | 171399494762496000 | 1124809184378880000 | 3411921192615936000 | 6336425072001024000 | 8042385668308992000 | 7372186862616576000 | 5026491042693120000 | 2585052536242176000 | 1005298208538624000 | 293211977490432000 | 62831138033664000 | 9519869399040000 | 951986939904000 | 54922323456000 | 1307674368000 | 35442540464018688000 |
Compute more
?
Technical details
- Node id
n-6bd0da8cabe63b8e· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-49d880ced4b36b3a
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 6, 2; 2: 48, 36, 6; 3: 480, 576, 216, 24; 4: 5760, 9600, 5760, 1440, 120; 5: 80640, 172800, 144000, 57600, 10800, 720; 6: 1290240, 3386880, 3628800, 2016000, 604800, 90720, 5040; 7: 23224320, 72253440, 94832640, 67737600, 28224000, 6773760, 846720, 40320; 8: 464486400, 1672151040, 2601123840, 2275983360, 1219276800, 406425600, 81285120, 8709120, 362880; 9: 10218700800, 41803776000, 75246796800, 78033715200, 51209625600, 21946982400, 6096384000, 1045094400, 97977600, 3628800;
%F FormulaThe row polynomials satisfy (n+1+x)*P(n,x) = (2*n^2+6*n+4+(n^2+5*n+4)*x+(n+1)*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 + 6*n + 4 + (n^2 + 5*n + 4)*x + (n + 1)*x^2)*P[n - 1, x])/(n + 1 + x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((2*n^2 + 6*n + 4 + (n^2 + 5*n + 4)*x + (n + 1)*x^2)*v[i - 1])/(n + 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, 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 T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- basis-map coefficients of A113214, shifted → x ↦ x+1 → D+1
- A038325 → basis A007318 → D+1
- A094305 → x ↦ x+1 → D+1
- A038208 → basis A007318 → D+1
- A003506 → x ↦ x+1 → D+1
- A178822 → x ↦ x+1 → D+1
- A038338 → x ↦ x+1 → D+1
- A178821 → basis A007318 → D+1
- A196347 → x ↦ x+1 → D+1
- A356546 → x ↦ x+1 → D+1
- A038330 → basis A013609 → D+1
- A093375 → x ↦ x+1
- A120910 → D+1
- A028326 → basis A007318 → D+1
- A093375 → x ↦ x+1 → reverse
- A085881 → basis A007318 → D+1
- A120910 → D → D+1
- A027466 → basis A013611 → D+1
- A038207 → D+1
- A093375 → D → basis A007318
- A178820 → basis A007318 → D+1
- A135065 → x ↦ x+1 → D+1
- A103406 → x ↦ x/(x+1)
- A085880 → x ↦ x+1 → D+1
- A038221 → x ↦ x+1 → D+1
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.