A178821 → basis A013610 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(20 + 12\,x + 5\,n + 3\,n x\right)\,P_{n-1}(x) + \left(12\,x + 3\,n 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 | 25 | 15 | 40 | |||||||||||||
| 2 | 375 | 585 | 135 | 1095 | ||||||||||||
| 3 | 4375 | 13545 | 7560 | 945 | 26425 | |||||||||||
| 4 | 43750 | 242970 | 247590 | 71820 | 5670 | 611800 | ||||||||||
| 5 | 393750 | 3735018 | 6214320 | 3146850 | 561330 | 30618 | 14081886 | |||||||||
| 6 | 3281250 | 51768990 | 132604290 | 104498100 | 31638600 | 3827250 | 153090 | 327771570 | ||||||||
| 7 | 25781250 | 666278910 | 2536213680 | 2924092710 | 1337836500 | 269438400 | 23575860 | 721710 | 7783939020 | |||||||
| 8 | 193359375 | 8111362545 | 44845780815 | 72818908470 | 47273247945 | 14103416250 | 2025839970 | 134238060 | 3247695 | 189509401125 | ||||||
| 9 | 1396484375 | 94569191145 | 747698866200 | 1666891865925 | 1476369469575 | 612282766095 | 128417709420 | 13820024790 | 717740595 | 14073345 | 4742178191465 | |||||
| 10 | 9775390625 | 1065040175199 | 11911753142289 | 35811415810170 | 42138539212770 | 23344669222875 | 6706637860923 | 1042403281920 | 87184372275 | 3644996355 | 59108049 | 122121122573450 | ||||
| 11 | 66650390625 | 11658610327455 | 183033279669240 | 732402382867155 | 1123349200974000 | 809057730130650 | 305845470640710 | 64394180335485 | 7712122693275 | 515717727525 | 17732414700 | 241805655 | 3238053319976475 | |||
| 12 | 444335937500 | 124625111722020 | 2731122543125340 | 14403644265530520 | 28392191420212620 | 26068269607380000 | 12615492020171040 | 3455713467526320 | 555778798815240 | 52852447147500 | 2890383596100 | 83181145320 | 967222620 | 88403108549532140 | ||
| 13 | 2905273437500 | 1305513563615940 | 39775061250943200 | 274411891145819700 | 687686859844884900 | 793170263764618740 | 481703009989481280 | 166985803513488960 | 34633871896904280 | 4392034614447480 | 339634849554000 | 15472660252140 | 378184044420 | 3794488740 | 2484422704345981280 | |
| 14 | 18676757812500 | 13439345566165740 | 567568561437286740 | 5092832134021249800 | 16089315802457788800 | 23048313241920466500 | 17304017169923904420 | 7440094184553201600 | 1935436751422317000 | 314288644311041400 | 32224273171370280 | 2065970106312840 | 79615962742680 | 1673369534340 | 14635885140 | 71839696059617079780 |
Compute more
?
Technical details
- Node id
n-d4101230aa2f77b9· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-c377b8329dc9dd7c
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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 25, 15; 2: 375, 585, 135; 3: 4375, 13545, 7560, 945; 4: 43750, 242970, 247590, 71820, 5670; 5: 393750, 3735018, 6214320, 3146850, 561330, 30618; 6: 3281250, 51768990, 132604290, 104498100, 31638600, 3827250, 153090; 7: 25781250, 666278910, 2536213680, 2924092710, 1337836500, 269438400, 23575860, 721710; 8: 193359375, 8111362545, 44845780815, 72818908470, 47273247945, 14103416250, 2025839970, 134238060, 3247695; 9: 1396484375, 94569191145, 747698866200, 1666891865925, 1476369469575, 612282766095, 128417709420, 13820024790, 717740595, 14073345;
%F FormulaThe row polynomials satisfy n*P(n,x) = (5*n+20+(3*n+12)*x)*P(n-1,x) + (3*n+12)*x*d/dx 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] + (3*n + 12)*x*D[P[n - 1, x], 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] + (3*n + 12)*x*deriv(v[i - 1], x))/(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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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 ?
- A028326 → basis A013610 → basis A008277
- A156992 → basis A013610 → basis A008277
- A038208 → basis A013610 → basis A008277
- A038221 → basis A013610 → basis A008277
- A178820 → basis A013610 → basis A008277
- A085880 → basis A013610 → basis A008277
- A013620 → basis A008277
- A196347 → basis A013610 → basis A008277
- A178822 → basis A013610 → basis A008277
- A225466 → D+1
- A038338 → basis A013610 → basis A008277
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.