A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
A038325 palindromic γ-positive nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel basis map preserves real roots 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 | 11 | 11 | 22 | |||||||||||||
| 2 | 121 | 242 | 121 | 484 | ||||||||||||
| 3 | 1331 | 3993 | 3993 | 1331 | 10648 | |||||||||||
| 4 | 14641 | 58564 | 87846 | 58564 | 14641 | 234256 | ||||||||||
| 5 | 161051 | 805255 | 1610510 | 1610510 | 805255 | 161051 | 5153632 | |||||||||
| 6 | 1771561 | 10629366 | 26573415 | 35431220 | 26573415 | 10629366 | 1771561 | 113379904 | ||||||||
| 7 | 19487171 | 136410197 | 409230591 | 682050985 | 682050985 | 409230591 | 136410197 | 19487171 | 2494357888 | |||||||
| 8 | 214358881 | 1714871048 | 6002048668 | 12004097336 | 15005121670 | 12004097336 | 6002048668 | 1714871048 | 214358881 | 54875873536 | ||||||
| 9 | 2357947691 | 21221529219 | 84886116876 | 198067606044 | 297101409066 | 297101409066 | 198067606044 | 84886116876 | 21221529219 | 2357947691 | 1207269217792 | |||||
| 10 | 25937424601 | 259374246010 | 1167184107045 | 3112490952120 | 5446859166210 | 6536230999452 | 5446859166210 | 3112490952120 | 1167184107045 | 259374246010 | 25937424601 | 26559922791424 | ||||
| 11 | 285311670611 | 3138428376721 | 15692141883605 | 47076425650815 | 94152851301630 | 131813991822282 | 131813991822282 | 94152851301630 | 47076425650815 | 15692141883605 | 3138428376721 | 285311670611 | 584318301411328 | |||
| 12 | 3138428376721 | 37661140520652 | 207136272863586 | 690454242878620 | 1553522046476895 | 2485635274363032 | 2899907820090204 | 2485635274363032 | 1553522046476895 | 690454242878620 | 207136272863586 | 37661140520652 | 3138428376721 | 12855002631049216 | ||
| 13 | 34522712143931 | 448795257871103 | 2692771547226618 | 9873495673164266 | 24683739182910665 | 44430730529239197 | 59240974038985596 | 59240974038985596 | 44430730529239197 | 24683739182910665 | 9873495673164266 | 2692771547226618 | 448795257871103 | 34522712143931 | 282810057883082752 | |
| 14 | 379749833583241 | 5316497670165374 | 34557234856074931 | 138228939424299724 | 380129583416824241 | 760259166833648482 | 1140388750250472723 | 1303301428857683112 | 1140388750250472723 | 760259166833648482 | 380129583416824241 | 138228939424299724 | 34557234856074931 | 5316497670165374 | 379749833583241 | 6221821273427820544 |
Generated b-files: A009966 (row sums), A038325, A038325 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-8064e72cf80883a7· revision 1 · JSON- Definition source
oeis_catalog:A038325- 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 ?
- A038325: reversed triangle, 36 terms agree, 8 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A009966: 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 ?
- A038325: triangle, 36 terms agree, 8 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: 11, 11; 2: 121, 242, 121; 3: 1331, 3993, 3993, 1331; 4: 14641, 58564, 87846, 58564, 14641; 5: 161051, 805255, 1610510, 1610510, 805255, 161051; 6: 1771561, 10629366, 26573415, 35431220, 26573415, 10629366, 1771561; 7: 19487171, 136410197, 409230591, 682050985, 682050985, 409230591, 136410197, 19487171; 8: 214358881, 1714871048, 6002048668, 12004097336, 15005121670, 12004097336, 6002048668, 1714871048, 214358881; 9: 2357947691, 21221529219, 84886116876, 198067606044, 297101409066, 297101409066, 198067606044, 84886116876, 21221529219, 2357947691;
%F FormulaThe row polynomials satisfy P(n,x) = (11+11*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[(11 + 11*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] = (11 + 11*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.
A038325: triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 11, 11; 2: 121, 242, 121; 3: 1331, 3993, 3993, 1331; 4: 14641, 58564, 87846, 58564, 14641; 5: 161051, 805255, 1610510, 1610510, 805255, 161051; 6: 1771561, 10629366, 26573415, 35431220, 26573415, 10629366, 1771561; 7: 19487171, 136410197, 409230591, 682050985, 682050985, 409230591, 136410197, 19487171; 8: 214358881, 1714871048, 6002048668, 12004097336, 15005121670, 12004097336, 6002048668, 1714871048, 214358881; 9: 2357947691, 21221529219, 84886116876, 198067606044, 297101409066, 297101409066, 198067606044, 84886116876, 21221529219, 2357947691;
%F FormulaThe row polynomials satisfy P(n,x) = (11+11*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[(11 + 11*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] = (11 + 11*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.
A038325: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 11, 11; 2: 121, 242, 121; 3: 1331, 3993, 3993, 1331; 4: 14641, 58564, 87846, 58564, 14641; 5: 161051, 805255, 1610510, 1610510, 805255, 161051; 6: 1771561, 10629366, 26573415, 35431220, 26573415, 10629366, 1771561; 7: 19487171, 136410197, 409230591, 682050985, 682050985, 409230591, 136410197, 19487171; 8: 214358881, 1714871048, 6002048668, 12004097336, 15005121670, 12004097336, 6002048668, 1714871048, 214358881; 9: 2357947691, 21221529219, 84886116876, 198067606044, 297101409066, 297101409066, 198067606044, 84886116876, 21221529219, 2357947691;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (11+11*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[(11 + 11*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] = (11 + 11*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-f7065dbe93a909bc -
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-cbffb05414f7627e,e-f7065dbe93a909bc -
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-cbffb05414f7627e,e-f7065dbe93a909bc -
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-f7065dbe93a909bc -
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-cbffb05414f7627e -
Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, +inf) to roots in (-inf, +inf): every real-rooted input has a real-rooted image (an affine substitution times g)
The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.by the cited steps:
e-eb1ef354593efa7c -
Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 11] to roots in (-inf, 0]: an input root r <= 11 gives the root (r - a)/d <= 0; a larger root gives a positive root
The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.by the cited steps:
e-eb1ef354593efa7c
Proof chains
3 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
-
basis_map_theorem
e-eb1ef354593efa7croot: theorem checkGeometric basis map (elementary) polytool ?
-
parent_provers periodic_product
e-cbffb05414f7627eroot: theorem checkParent-row provers of polytool polytool ?
-
theorem_check liu_wang
e-f7065dbe93a909bcroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
Used in 8 proof steps
e-290484f08292dc0abasis_map (A013609) → basis_map_A013609 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-6a2839a9935a683bbasis_map (A013611) → basis_map_A013611 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-a5d0659f5315d3b7basis_map (A007318) → basis_map_A007318 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-bb91b382acf43386basis_map (A013610) → basis_map_A013610 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-f221360d3c3c712fbasis_map (A008277) → basis_map_A008277 of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)…e-fb31a786d366dda0gamma_polynomial (scale 1, shift 0) → gamma_polynomial of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*…e-d2886dc5bcf83686obreschkoff_combination → obreschkoff_combination of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11…e-d2886dc5bcf83686obreschkoff_combination → obreschkoff_combination of Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11…
Related sequences ?
Same fingerprint (59)
Equal up to content, sign, reversal and a small index shift.
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
- A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
- A178822 → D
- A007318 → ×(−(1/2)n+(1/2)n²) → D
- basis-map coefficients of A021012 → x ↦ x+1
- A344565 → D
- basis-map coefficients of A026729 → basis A007318
- A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- basis-map coefficients of A112227 → x ↦ x+1
- A038330 → basis A013611
- A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
- A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
- A085880 → D
- A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
- A135838 → D
- A085880 → basis A013609
- A007318 → ×(1+(3/2)n+(1/2)n²) → D
- A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
- A344565 → basis A013609
- A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- A010054 → reverse → x ↦ x+1
- A038221 → basis A013609
- A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A00010…
- A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
- A028326 → D
- A120910 → basis A013610
- A178821 → D
- A027465 → basis A013611
- A007318 → D → D
- A135065: A127733 * A007318 as infinite lower triangular matrices.
- A028326 → basis A013609
- A178820 → basis A013609
- A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- A038325 → basis A013609
- A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- A135838 → basis A013609
- A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- A178820 → D
- A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
- A196347 → basis A013609
- Riordan array (1-x,x/(1-x)).
- A178822 → basis A013609
- A038338 → basis A013609
- A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- A038208 → D
- A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- basis-map coefficients of A113214, shifted → D
- A356546 → basis A013609
- A156992 → basis A013609
- A007318: Binomial
- A178821 → basis A013609
- A007318 → ×(1+2n+n²) → D
- A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- A216973: Exponential Riordan array [x*exp(x),x].
- basis-map coefficients of A113214, shifted → basis A013609
- basis-map coefficients of A026729, shifted → basis A007318
- basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
- A085881 → 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