A142459: Triangle read by rows: T(n,k) = (4n-4k+1) * T(n-1,k-1) + (4k-3) * T(n-1,k).

A142459 palindromic γ-positive nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence from OEIS A142459
\(P_{n}(x) = \left(1 - 7\,x + 4\,n x\right)\,P_{n-1}(x) + \left(4\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2112
3110112
4159591120
51308106230811680
61155713562135621557130240
71780614852735261214852778061665280
8139055150066971089157108915150066939055117297280
9119530414482396123929944241703110123929944144823961953041518918400
1019765531360053801973149172671148169467114816941973149172136005380976553117643225600
111488280212562746692959509525616342391809828188223114816342391809829595095256125627466948828021670442572800
12124414051114871356954261933024053636464370090100051248065581000512480655836364643700904261933024051148713569524414051128158588057600
13112207030010438519734659655369519807588427327089531556508767032850025624032790031556508767032875884273270895596553695198010438519734612207030011295295050649600
141610351549944959939614818317734669261510757512828475913104785901642321657793550637012216577935506370129131047859016423151075751282847581831773466926944959939614610351549164764752532480000
1513051757798853454668242711063362523526682903798043022804124765003301399845884276941811346725912561520259369466968427694181134672592476500330139984582903798043022804111063362523526688534546682427305175779813497296636753920000

Generated b-files: A001813 (row sums), A142459, A142459 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-d023ddeb9da11712 · revision 1 · JSON
Definition source
oeis_catalog:A142459
Fingerprint
f6-127028c66ab36cef

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 -1)
  • 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 ℚ): no

OEIS matches ?

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 1,      1;
   3: 1,     10,         1;
   4: 1,     59,        59,          1;
   5: 1,    308,      1062,        308,          1;
   6: 1,   1557,     13562,      13562,       1557,          1;
   7: 1,   7806,    148527,     352612,     148527,       7806,          1;
   8: 1,  39055,   1500669,    7108915,    7108915,    1500669,      39055,         1;
   9: 1, 195304,  14482396,  123929944,  241703110,  123929944,   14482396,    195304,      1;
  10: 1, 976553, 136005380, 1973149172, 6711481694, 6711481694, 1973149172, 136005380, 976553, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(4*n-7)*x)*P(n-1,x) + (4*x-4*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (4*n - 7)*x)*P[n - 1, x] + (4*x - 4*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (4*n - 7)*x)*v[i - 1] + (4*x - 4*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A142459: triangle, offset 1, from the row P1
%e Example
Triangle begins:
   1: 1;
   2: 1,      1;
   3: 1,     10,         1;
   4: 1,     59,        59,          1;
   5: 1,    308,      1062,        308,          1;
   6: 1,   1557,     13562,      13562,       1557,          1;
   7: 1,   7806,    148527,     352612,     148527,       7806,          1;
   8: 1,  39055,   1500669,    7108915,    7108915,    1500669,      39055,         1;
   9: 1, 195304,  14482396,  123929944,  241703110,  123929944,   14482396,    195304,      1;
  10: 1, 976553, 136005380, 1973149172, 6711481694, 6711481694, 1973149172, 136005380, 976553, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(4*n-7)*x)*P(n-1,x) + (4*x-4*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (4*n - 7)*x)*P[n - 1, x] + (4*x - 4*x^2)*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (4*n - 7)*x)*v[i - 1] + (4*x - 4*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A142459: reversed triangle, offset 1, from the row P1
%e Example
Triangle begins:
   1: 1;
   2: 1,      1;
   3: 1,     10,         1;
   4: 1,     59,        59,          1;
   5: 1,    308,      1062,        308,          1;
   6: 1,   1557,     13562,      13562,       1557,          1;
   7: 1,   7806,    148527,     352612,     148527,       7806,          1;
   8: 1,  39055,   1500669,    7108915,    7108915,    1500669,      39055,         1;
   9: 1, 195304,  14482396,  123929944,  241703110,  123929944,   14482396,    195304,      1;
  10: 1, 976553, 136005380, 1973149172, 6711481694, 6711481694, 1973149172, 136005380, 976553, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(4*n-7)*x)*P(n-1,x) + (4*x-4*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (4*n - 7)*x)*P[n - 1, x] + (4*x - 4*x^2)*D[P[n - 1, x], x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (4*n - 7)*x)*v[i - 1] + (4*x - 4*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-ce13bfb75f31b51b
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-ce13bfb75f31b51b
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-ce13bfb75f31b51b
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-ce13bfb75f31b51b

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

Used in 3 proof steps

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

References

  1. [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