A178821 → basis A013610 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(20 + 12\,x + 5\,n + 3\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 25 | 15 | 40 | ||||||
| 2 | 375 | 450 | 135 | 960 | |||||
| 3 | 4375 | 7875 | 4725 | 945 | 17920 | ||||
| 4 | 43750 | 105000 | 94500 | 37800 | 5670 | 286720 | |||
| 5 | 393750 | 1181250 | 1417500 | 850500 | 255150 | 30618 | 4128768 | ||
| 6 | 3281250 | 11812500 | 17718750 | 14175000 | 6378750 | 1530900 | 153090 | 55050240 | |
| 7 | 25781250 | 108281250 | 194906250 | 194906250 | 116943750 | 42099750 | 8419950 | 721710 | 692060160 |
Compute more
?
Technical details
- Node id
n-8c7af6eedfa5a565· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-b1029f17d1b64336
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: 25, 15; 2: 375, 450, 135; 3: 4375, 7875, 4725, 945; 4: 43750, 105000, 94500, 37800, 5670; 5: 393750, 1181250, 1417500, 850500, 255150, 30618; 6: 3281250, 11812500, 17718750, 14175000, 6378750, 1530900, 153090; 7: 25781250, 108281250, 194906250, 194906250, 116943750, 42099750, 8419950, 721710; 8: 193359375, 928125000, 1949062500, 2338875000, 1754156250, 841995000, 252598500, 43302600, 3247695; 9: 1396484375, 7541015625, 18098437500, 25337812500, 22804031250, 13682418750, 5472967500, 1407334500, 211100175, 14073345;
%F FormulaThe row polynomials satisfy n*P(n,x) = (5*n+20+(3*n+12)*x)*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[((5*n + 20 + (3*n + 12)*x)*P[n - 1, x])/(n)]];
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] = ((5*n + 20 + (3*n + 12)*x)*v[i - 1])/(n)); 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
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A038231 → D → basis A013610
- A013622 → basis A013609 → basis A013610
- A013612 → basis A013609 → D
- A038338 → basis A013610 → x ↦ x+1
- A013622: Triangle of coefficients in expansion of (3+5x)^n.
- A038319 → basis A013611 → basis A013610
- A038243 → basis A013611 → x ↦ x/(x+1)
- A013612 → basis A013609
- A038221 → basis A013610 → basis A007318
- A028326 → basis A013610 → x ↦ x+1
- A196347 → basis A013610 → basis A007318
- A013620 → basis A007318
- A038271 → basis A013611 → D
- A120910 → basis A013609 → x ↦ x/(x+1)
- A027467 → basis A013611 → basis A013610
- A156992 → basis A013610 → x ↦ x+1
- A038329 → basis A013610 → D
- A038255 → basis A013610 → basis A013609
- A038284 → basis A007318 → basis A013609
- A178820 → basis A013610 → x ↦ x+1
- A178822 → basis A013610 → basis A007318
- A013620 → basis A007318 → D
- A013612 → basis A013609 → reverse
- A038271 → basis A013610 → basis A013610
- A038329 → basis A013610 → reverse
- A038329 → basis A013610
- A038271 → basis A013611
- A038334 → x ↦ x/(x+1)
- A085880 → basis A013610 → x ↦ x+1
- A038335 → x ↦ x+1 → basis A013609
- A013622 → D
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.