A178822 → 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(25 + 15\,x + 5\,n + 3\,n x\right)\,P_{n-1}(x) + \left(15\,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 | 30 | 18 | 48 | |||||||||||||
| 2 | 525 | 819 | 189 | 1533 | ||||||||||||
| 3 | 7000 | 21672 | 12096 | 1512 | 42280 | |||||||||||
| 4 | 78750 | 437346 | 445662 | 129276 | 10206 | 1101240 | ||||||||||
| 5 | 787500 | 7470036 | 12428640 | 6293700 | 1122660 | 61236 | 28163772 | |||||||||
| 6 | 7218750 | 113891778 | 291729438 | 229895820 | 69604920 | 8419950 | 336798 | 721097454 | ||||||||
| 7 | 61875000 | 1599069384 | 6086912832 | 7017822504 | 3210807600 | 646652160 | 56582064 | 1732104 | 18681453648 | |||||||
| 8 | 502734375 | 21089542617 | 116599030119 | 189329162022 | 122910444657 | 36668882250 | 5267183922 | 349018956 | 8444007 | 492724442925 | ||||||
| 9 | 3910156250 | 264793735206 | 2093556825360 | 4667297224590 | 4133834514810 | 1714391745066 | 359569586376 | 38696069412 | 2009673666 | 39405366 | 13278098936102 | |||||
| 10 | 29326171875 | 3195120525597 | 35735259426867 | 107434247430510 | 126415617638310 | 70034007668625 | 20119913582769 | 3127209845760 | 261553116825 | 10934989065 | 177324147 | 366363367720350 | ||||
| 11 | 213281250000 | 37307553047856 | 585706494941568 | 2343687625174896 | 3594717443116800 | 2588984736418080 | 978705506050272 | 206061377073552 | 24678792618480 | 1650296728080 | 56743727040 | 773778096 | 10361770623924720 | |||
| 12 | 1510742187500 | 423725379854868 | 9285816646626156 | 48972390502803768 | 96533450828722908 | 88632116665092000 | 42892672868581536 | 11749425789589488 | 1889647915971816 | 179698320301500 | 9827304226740 | 282815894088 | 3288556908 | 300570569068409276 | ||
| 13 | 10458984375000 | 4699848829017384 | 143190220503395520 | 987882808124950920 | 2475672695441585640 | 2855412949552627464 | 1734130835962132608 | 601148892648560256 | 124681938828855408 | 15811324612010928 | 1222685458394400 | 55701576907704 | 1361462559912 | 13660159464 | 8943921735645532608 | |
| 14 | 70971679687500 | 51069513151429812 | 2156760533461689612 | 19352762109280749240 | 61139400049339597440 | 87583590319297772700 | 65755265245710836796 | 28272357901302166080 | 7354659655404804600 | 1194296848381957320 | 122452238051207064 | 7850686403988792 | 302540658422184 | 6358804230492 | 55616363532 | 272990845026544903164 |
Compute more
?
Technical details
- Node id
n-4d910af6db5dc7ca· 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: 30, 18; 2: 525, 819, 189; 3: 7000, 21672, 12096, 1512; 4: 78750, 437346, 445662, 129276, 10206; 5: 787500, 7470036, 12428640, 6293700, 1122660, 61236; 6: 7218750, 113891778, 291729438, 229895820, 69604920, 8419950, 336798; 7: 61875000, 1599069384, 6086912832, 7017822504, 3210807600, 646652160, 56582064, 1732104; 8: 502734375, 21089542617, 116599030119, 189329162022, 122910444657, 36668882250, 5267183922, 349018956, 8444007; 9: 3910156250, 264793735206, 2093556825360, 4667297224590, 4133834514810, 1714391745066, 359569586376, 38696069412, 2009673666, 39405366;
%F FormulaThe row polynomials satisfy n*P(n,x) = (5*n+25+(3*n+15)*x)*P(n-1,x) + (3*n+15)*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 + 25 + (3*n + 15)*x)*P[n - 1, x] + (3*n + 15)*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 + 25 + (3*n + 15)*x)*v[i - 1] + (3*n + 15)*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) = C(n+5,5) * C(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+5,5) * C(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 ›
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) = C(n+5,5) * C(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) = C(n+5,5) * C(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) = C(n+5,5) * C(n,k), 0 <= k <= n.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A196347 → basis A013610 → basis A008277
- A038338 → basis A013610 → basis A008277
- A038208 → basis A013610 → basis A008277
- A085880 → basis A013610 → basis A008277
- A225466 → D+1
- A028326 → basis A013610 → basis A008277
- A013620 → basis A008277
- A178821 → basis A013610 → basis A008277
- A038221 → basis A013610 → basis A008277
- A178820 → basis A013610 → basis A008277
- A156992 → 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.