A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
A085881 palindromic γ-positive 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 | 1 | 1 | ||||||||||||||
| 1 | 1 | 1 | 2 | |||||||||||||
| 2 | 3 | 6 | 3 | 12 | ||||||||||||
| 3 | 15 | 45 | 45 | 15 | 120 | |||||||||||
| 4 | 105 | 420 | 630 | 420 | 105 | 1680 | ||||||||||
| 5 | 945 | 4725 | 9450 | 9450 | 4725 | 945 | 30240 | |||||||||
| 6 | 10395 | 62370 | 155925 | 207900 | 155925 | 62370 | 10395 | 665280 | ||||||||
| 7 | 135135 | 945945 | 2837835 | 4729725 | 4729725 | 2837835 | 945945 | 135135 | 17297280 | |||||||
| 8 | 2027025 | 16216200 | 56756700 | 113513400 | 141891750 | 113513400 | 56756700 | 16216200 | 2027025 | 518918400 | ||||||
| 9 | 34459425 | 310134825 | 1240539300 | 2894591700 | 4341887550 | 4341887550 | 2894591700 | 1240539300 | 310134825 | 34459425 | 17643225600 | |||||
| 10 | 654729075 | 6547290750 | 29462808375 | 78567489000 | 137493105750 | 164991726900 | 137493105750 | 78567489000 | 29462808375 | 6547290750 | 654729075 | 670442572800 | ||||
| 11 | 13749310575 | 151242416325 | 756212081625 | 2268636244875 | 4537272489750 | 6352181485650 | 6352181485650 | 4537272489750 | 2268636244875 | 756212081625 | 151242416325 | 13749310575 | 28158588057600 | |||
| 12 | 316234143225 | 3794809718700 | 20871453452850 | 69571511509500 | 156535900896375 | 250457441434200 | 292200348339900 | 250457441434200 | 156535900896375 | 69571511509500 | 20871453452850 | 3794809718700 | 316234143225 | 1295295050649600 | ||
| 13 | 7905853580625 | 102776096548125 | 616656579288750 | 2261074124058750 | 5652685310146875 | 10174833558264375 | 13566444744352500 | 13566444744352500 | 10174833558264375 | 5652685310146875 | 2261074124058750 | 616656579288750 | 102776096548125 | 7905853580625 | 64764752532480000 | |
| 14 | 213458046676875 | 2988412653476250 | 19424682247595625 | 77698728990382500 | 213671504723551875 | 427343009447103750 | 641014514170655625 | 732588016195035000 | 641014514170655625 | 427343009447103750 | 213671504723551875 | 77698728990382500 | 19424682247595625 | 2988412653476250 | 213458046676875 | 3497296636753920000 |
Generated b-files: A001813 (row sums), A085881, A085881 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-c7809537965f400d· revision 1 · JSON- Definition source
oeis_catalog:A085881- Fingerprint
f6-77a7ed3b1d5f257e
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: yes
- γ-positive (gamma_positive): yes
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes
OEIS matches ?
- A001813: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
- A085881: triangle, 45 terms agree, 9 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A085881: reversed triangle, 45 terms agree, 9 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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: 1; 1: 1, 1; 2: 3, 6, 3; 3: 15, 45, 45, 15; 4: 105, 420, 630, 420, 105; 5: 945, 4725, 9450, 9450, 4725, 945; 6: 10395, 62370, 155925, 207900, 155925, 62370, 10395; 7: 135135, 945945, 2837835, 4729725, 4729725, 2837835, 945945, 135135; 8: 2027025, 16216200, 56756700, 113513400, 141891750, 113513400, 56756700, 16216200, 2027025; 9: 34459425, 310134825, 1240539300, 2894591700, 4341887550, 4341887550, 2894591700, 1240539300, 310134825, 34459425;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n-1+(2*n-1)*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[(2*n - 1 + (2*n - 1)*x)*P[n - 1, x]];
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] = (2*n - 1 + (2*n - 1)*x)*v[i - 1]); 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.
A085881: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 1, 1; 2: 3, 6, 3; 3: 15, 45, 45, 15; 4: 105, 420, 630, 420, 105; 5: 945, 4725, 9450, 9450, 4725, 945; 6: 10395, 62370, 155925, 207900, 155925, 62370, 10395; 7: 135135, 945945, 2837835, 4729725, 4729725, 2837835, 945945, 135135; 8: 2027025, 16216200, 56756700, 113513400, 141891750, 113513400, 56756700, 16216200, 2027025; 9: 34459425, 310134825, 1240539300, 2894591700, 4341887550, 4341887550, 2894591700, 1240539300, 310134825, 34459425;
%F FormulaThe row polynomials satisfy P(n,x) = (2*n-1+(2*n-1)*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[(2*n - 1 + (2*n - 1)*x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (2*n - 1 + (2*n - 1)*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)Generated with polytool c48629374597.
A085881: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 1, 1; 2: 3, 6, 3; 3: 15, 45, 45, 15; 4: 105, 420, 630, 420, 105; 5: 945, 4725, 9450, 9450, 4725, 945; 6: 10395, 62370, 155925, 207900, 155925, 62370, 10395; 7: 135135, 945945, 2837835, 4729725, 4729725, 2837835, 945945, 135135; 8: 2027025, 16216200, 56756700, 113513400, 141891750, 113513400, 56756700, 16216200, 2027025; 9: 34459425, 310134825, 1240539300, 2894591700, 4341887550, 4341887550, 2894591700, 1240539300, 310134825, 34459425;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2*n-1+(2*n-1)*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[(2*n - 1 + (2*n - 1)*x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {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] = (2*n - 1 + (2*n - 1)*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); 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-1d211cea19207c02 -
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-088407700c450d53,e-1d211cea19207c02 -
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-088407700c450d53,e-1d211cea19207c02 -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-1d211cea19207c02 -
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-088407700c450d53
Proof chains
2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
parent_provers root_domain
e-088407700c450d53root: theorem checkParent-row provers of polytool polytool ?
-
theorem_check liu_wang
e-1d211cea19207c02root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
Used in 8 proof steps
e-0adda7d4e180ead0basis_map (A013610) → basis_map_A013610 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A…e-0f3734a094503340basis_map (A013609) → basis_map_A013609 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A…e-20dcbad557ba463bbasis_map (A013611) → basis_map_A013611 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A…e-380a606cb73e0af7basis_map (A008277) → basis_map_A008277 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A…e-5048ce3ebd740a6fbasis_map (A007318) → basis_map_A007318 of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A…e-a9c75dc8bc8e63f9gamma_polynomial (scale 1, shift 0) → gamma_polynomial of Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A0…e-7d570c2107f82786obreschkoff_combination → obreschkoff_combination of Triangle T(n,k) read by rows: multiply row n of Pascal's trian…e-7d570c2107f82786obreschkoff_combination → obreschkoff_combination of Triangle T(n,k) read by rows: multiply row n of Pascal's trian…
Related sequences ?
Same fingerprint (59)
Equal up to content, sign, reversal and a small index shift.
- A135065: A127733 * A007318 as infinite lower triangular matrices.
- A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- A344565 → basis A013609
- A028326 → basis A013609
- A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
- A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
- basis-map coefficients of A112227 → x ↦ x+1
- A178821 → D
- A028326 → D
- A038325 → basis A013609
- A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
- A085881 → basis A013609
- A156992 → basis A013609
- A178822 → D
- A038330 → basis A013611
- A007318 → ×(1+(3/2)n+(1/2)n²) → D
- A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A00010…
- A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
- A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
- A135838 → D
- basis-map coefficients of A026729 → basis A007318
- A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- A027465 → basis A013611
- A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- A216973: Exponential Riordan array [x*exp(x),x].
- A007318: Binomial
- basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
- A178820 → basis A013609
- A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- basis-map coefficients of A113214, shifted → D
- A344565 → D
- A085880 → basis A013609
- A196347 → basis A013609
- A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
- A085880 → D
- basis-map coefficients of A021012 → x ↦ x+1
- A178820 → D
- A178822 → basis A013609
- A007318 → ×(−(1/2)n+(1/2)n²) → D
- A007318 → ×(1+2n+n²) → D
- Riordan array (1-x,x/(1-x)).
- A007318 → D → D
- A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
- A135838 → basis A013609
- A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
- A038208 → D
- A120910 → basis A013610
- A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
- A038338 → basis A013609
- basis-map coefficients of A026729, shifted → basis A007318
- A038221 → basis A013609
- A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- A178821 → basis A013609
- A010054 → reverse → x ↦ x+1
- basis-map coefficients of A113214, shifted → basis A013609
- A356546 → basis A013609
- A156992: Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
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