Real-rooted atlas

A142460: Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 5.

A142460 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 A142460
\(P_{n}(x) = \left(1 - 4\,x + 5\,n x\right)\,P_{n-1}(x) + \left(5\,x - 5\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1112
2112114
3183831168
41514182651412856
51310528310283103105162832
61186563766159059203766151865611696464
71111967462782122403635224036354627821111967154286848

Show all 15 stored rows

Generated b-files: A047055 (row sums), A142460, A142460 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-05516f61aeaea779 · revision 1 · JSON
Definition source
oeis_catalog:A142460
Fingerprint
f6-e651ceaa6652ce47

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 ℚ): 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,       1;
  2: 1,      12,         1;
  3: 1,      83,        83,          1;
  4: 1,     514,      1826,        514,           1;
  5: 1,    3105,     28310,      28310,        3105,           1;
  6: 1,   18656,    376615,     905920,      376615,       18656,          1;
  7: 1,  111967,   4627821,   22403635,    22403635,     4627821,     111967,         1;
  8: 1,  671838,  54377008,  478781506,   940952670,   478781506,   54377008,    671838,       1;
  9: 1, 4031069, 622333256, 9346191344, 32208325226, 32208325226, 9346191344, 622333256, 4031069, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(5*n-4)*x)*P(n-1,x) + (5*x-5*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (5*n - 4)*x)*P[n - 1, x] + (5*x - 5*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (1 + (5*n - 4)*x)*v[i - 1] + (5*x - 5*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 - 1, v[i])))};
T(9)

Generated with polytool c48629374597.

A142460: triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,       1;
   3: 1,      12,         1;
   4: 1,      83,        83,          1;
   5: 1,     514,      1826,        514,           1;
   6: 1,    3105,     28310,      28310,        3105,           1;
   7: 1,   18656,    376615,     905920,      376615,       18656,          1;
   8: 1,  111967,   4627821,   22403635,    22403635,     4627821,     111967,         1;
   9: 1,  671838,  54377008,  478781506,   940952670,   478781506,   54377008,    671838,       1;
  10: 1, 4031069, 622333256, 9346191344, 32208325226, 32208325226, 9346191344, 622333256, 4031069, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(5*n-9)*x)*P(n-1,x) + (5*x-5*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 + (5*n - 9)*x)*P[n - 1, x] + (5*x - 5*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 + (5*n - 9)*x)*v[i - 1] + (5*x - 5*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.

A142460: reversed triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,       1;
   3: 1,      12,         1;
   4: 1,      83,        83,          1;
   5: 1,     514,      1826,        514,           1;
   6: 1,    3105,     28310,      28310,        3105,           1;
   7: 1,   18656,    376615,     905920,      376615,       18656,          1;
   8: 1,  111967,   4627821,   22403635,    22403635,     4627821,     111967,         1;
   9: 1,  671838,  54377008,  478781506,   940952670,   478781506,   54377008,    671838,       1;
  10: 1, 4031069, 622333256, 9346191344, 32208325226, 32208325226, 9346191344, 622333256, 4031069, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(5*n-9)*x)*P(n-1,x) + (5*x-5*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 + (5*n - 9)*x)*P[n - 1, x] + (5*x - 5*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 + (5*n - 9)*x)*v[i - 1] + (5*x - 5*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 >= 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-c01d44af586f9efe
  • 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-c01d44af586f9efe
  • 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-c01d44af586f9efe
  • 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-c01d44af586f9efe

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

No candidate equalities or related sequences.

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