A344565 → basis A013610
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 3 | ||||||||||||||
| 1 | 30 | 45 | 75 | |||||||||||||
| 2 | 180 | 540 | 405 | 1125 | ||||||||||||
| 3 | 840 | 3780 | 5670 | 2835 | 13125 | |||||||||||
| 4 | 3360 | 20160 | 45360 | 45360 | 17010 | 131250 | ||||||||||
| 5 | 12096 | 90720 | 272160 | 408240 | 306180 | 91854 | 1181250 | |||||||||
| 6 | 40320 | 362880 | 1360800 | 2721600 | 3061800 | 1837080 | 459270 | 9843750 | ||||||||
| 7 | 126720 | 1330560 | 5987520 | 14968800 | 22453200 | 20207880 | 10103940 | 2165130 | 77343750 | |||||||
| 8 | 380160 | 4561920 | 23950080 | 71850240 | 134719200 | 161663040 | 121247280 | 51963120 | 9743085 | 580078125 | ||||||
| 9 | 1098240 | 14826240 | 88957440 | 311351040 | 700539840 | 1050809760 | 1050809760 | 675520560 | 253320210 | 42220035 | 4189453125 | |||||
| 10 | 3075072 | 46126080 | 311351040 | 1245404160 | 3269185920 | 5884534656 | 7355668320 | 6304858560 | 3546482940 | 1182160980 | 177324147 | 29326171875 | ||||
| 11 | 8386560 | 138378240 | 1037836800 | 4670265600 | 14010796800 | 29422673280 | 44134009920 | 47286439200 | 35464829400 | 17732414700 | 5319724410 | 725416965 | 199951171875 | |||
| 12 | 22364160 | 402554880 | 3321077760 | 16605388800 | 56043187200 | 134503649280 | 235381386240 | 302633210880 | 283718635200 | 189145756800 | 85115590560 | 23213342880 | 2901667860 | 1333007812500 | ||
| 13 | 58490880 | 1140572160 | 10265149440 | 56458321920 | 211718707200 | 571640509440 | 1143281018880 | 1714921528320 | 1929286719360 | 1607738932800 | 964643359680 | 394626828960 | 98656707240 | 11383466220 | 8715820312500 | |
| 14 | 150405120 | 3158507520 | 30795448320 | 184772689920 | 762187345920 | 2286562037760 | 5144764584960 | 8819596431360 | 11575720316160 | 11575720316160 | 8681790237120 | 4735521947520 | 1775820730320 | 409804783920 | 43907655420 | 56030273437500 |
Computed in your browser ?
Technical details
- Node id
n-936114cbd4070c9a· revision 1 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-f06e51c139cfae05
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
OEIS matches ?
No OEIS matches.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 3; 1: 30, 45; 2: 180, 540, 405; 3: 840, 3780, 5670, 2835; 4: 3360, 20160, 45360, 45360, 17010; 5: 12096, 90720, 272160, 408240, 306180, 91854; 6: 40320, 362880, 1360800, 2721600, 3061800, 1837080, 459270; 7: 126720, 1330560, 5987520, 14968800, 22453200, 20207880, 10103940, 2165130; 8: 380160, 4561920, 23950080, 71850240, 134719200, 161663040, 121247280, 51963120, 9743085; 9: 1098240, 14826240, 88957440, 311351040, 700539840, 1050809760, 1050809760, 675520560, 253320210, 42220035;
%F FormulaThe row polynomials satisfy n*P(n,x) = (2*n+8+(3*n+12)*x)*P(n-1,x) for n >= 1, with P(0,x) = 3.
%t MathematicaP[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((2*n + 8 + (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] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 8 + (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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-127cb25e0d856e7f -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-127cb25e0d856e7f -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-127cb25e0d856e7f -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-127cb25e0d856e7f
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map A013610
e-127cb25e0d856e7fGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-e2cde2e22920ce64root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-4dae17a76888d380Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
-
-
premise (sequence):
Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
Related sequences ?
Same fingerprint (23)
Equal up to content, sign, reversal and a small index shift.
- basis-map coefficients of A113214, shifted → basis A013610
- A013620 → D
- A135838 → basis A013610
- A156992 → basis A013610
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*8^j.
- A038220 → D
- A178820 → basis A013610
- A038338 → basis A013610
- A038325 → basis A013610
- A038208 → basis A013610
- A178822 → basis A013610
- A038221 → basis A013610
- A356546 → basis A013610
- A178821 → basis A013610
- A038220: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*2^j.
- A085880 → basis A013610
- A013620: Triangle of coefficients in expansion of (2+3x)^n.
- A085881 → basis A013610
- A028326 → basis A013610
- A120910 → x ↦ x/(x+1)
- A038243 → basis A013611
- A120910 → basis A013609
- A196347 → basis A013610
References
- [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