A178820 → basis A013610 → basis A013611
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(15 + 36\,x + 5\,n + 12\,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 | 20 | 48 | 68 | |||||||||||||
| 2 | 250 | 1200 | 1440 | 2890 | ||||||||||||
| 3 | 2500 | 18000 | 43200 | 34560 | 98260 | |||||||||||
| 4 | 21875 | 210000 | 756000 | 1209600 | 725760 | 2923235 | ||||||||||
| 5 | 175000 | 2100000 | 10080000 | 24192000 | 29030400 | 13934592 | 79511992 | |||||||||
| 6 | 1312500 | 18900000 | 113400000 | 362880000 | 653184000 | 627056640 | 250822656 | 2027555796 | ||||||||
| 7 | 9375000 | 157500000 | 1134000000 | 4536000000 | 10886400000 | 15676416000 | 12541132800 | 4299816960 | 49240640760 | |||||||
| 8 | 64453125 | 1237500000 | 10395000000 | 49896000000 | 149688000000 | 287400960000 | 344881152000 | 236489932800 | 70946979840 | 1150999977765 | ||||||
| 9 | 429687500 | 9281250000 | 89100000000 | 498960000000 | 1796256000000 | 4311014400000 | 6897623040000 | 7094697984000 | 4256818790400 | 1135151677440 | 26089332829340 | |||||
| 10 | 2792968750 | 67031250000 | 723937500000 | 4633200000000 | 19459440000000 | 56043187200000 | 112086374400000 | 153718456320000 | 138346610688000 | 73784859033600 | 17708366168064 | 576574255528414 | ||||
| 11 | 17773437500 | 469218750000 | 5630625000000 | 40540500000000 | 194594400000000 | 653837184000000 | 1569209241600000 | 2690072985600000 | 3228087582720000 | 2582470066176000 | 1239585631764480 | 270455046930432 | 12474970255978412 | |||
| 12 | 111083984375 | 3199218750000 | 42229687500000 | 337837500000000 | 1824322500000000 | 7005398400000000 | 19615115520000000 | 40351094784000000 | 60526642176000000 | 64561751654400000 | 46484461191168000 | 20284128519782400 | 4056825703956480 | 265093117939541255 | ||
| 13 | 683593750000 | 21328125000000 | 307125000000000 | 2702700000000000 | 16216200000000000 | 70053984000000000 | 224172748800000000 | 538014597120000000 | 968426274816000000 | 1291235033088000000 | 1239585631764480000 | 811365140791296000 | 324546056316518400 | 59916195012280320 | 5546563698427324720 | |
| 14 | 4150390625000 | 139453125000000 | 2175468750000000 | 20884500000000000 | 137837700000000000 | 661620960000000000 | 2381835456000000000 | 6533034393600000000 | 13719372226560000000 | 21950995562496000000 | 26341194674995200000 | 22988678989086720000 | 13793207393452032000 | 5092876576043827200 | 873064555893227520 | 114496922060392631720 |
Compute more
?
Technical details
- Node id
n-addb922a253e8369· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-f055f948fcf55643
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: 20, 48; 2: 250, 1200, 1440; 3: 2500, 18000, 43200, 34560; 4: 21875, 210000, 756000, 1209600, 725760; 5: 175000, 2100000, 10080000, 24192000, 29030400, 13934592; 6: 1312500, 18900000, 113400000, 362880000, 653184000, 627056640, 250822656; 7: 9375000, 157500000, 1134000000, 4536000000, 10886400000, 15676416000, 12541132800, 4299816960; 8: 64453125, 1237500000, 10395000000, 49896000000, 149688000000, 287400960000, 344881152000, 236489932800, 70946979840; 9: 429687500, 9281250000, 89100000000, 498960000000, 1796256000000, 4311014400000, 6897623040000, 7094697984000, 4256818790400, 1135151677440;
%F FormulaThe row polynomials satisfy n*P(n,x) = (5*n+15+(12*n+36)*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 + 15 + (12*n + 36)*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 + 15 + (12*n + 36)*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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * 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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * 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+3,3) * 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+3,3) * C(n,k), 0 <= k <= n.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A136572 → basis A013611 → basis A013610
- A013620 → basis A013611 → D
- A038331 → D
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*5^j.
- A038271 → basis A007318
- A085880 → basis A013610 → basis A013611
- A178822 → basis A013610 → basis A013611
- A028326 → basis A013610 → basis A013611
- A038271 → basis A007318 → D
- A130123 → basis A013611 → basis A013610
- A178821 → basis A013610 → basis A013611
- A038331 → reverse
- A013611 → D → basis A013610
- A013620 → basis A013611
- basis-map coefficients of A112227 → basis A013611 → basis A013610
- basis-map coefficients of A026729 → basis A013611 → basis A013610
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.