A144443: Triangle read by rows: T(n, k) = (6*n-6*k+1)*T(n-1, k-1) + (6*k-5)*T(n-1, k) + 6*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.

A144443 palindromic γ-positive nonnegative coefficients

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

Recurrence from OEIS A144443
\(P_{n}(x) = \left(1 - 5\,x + 6\,n x\right)\,P_{n-1}(x) + \left(6\,x - 6\,x^{2}\right)\,P_{n-1}'(x) + \left(6\,x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
2120122
311591591320
4111384254113816532
517997778787787879971171752
61560161219167298488812191675601615535256
71392155176336498765931587659315176336493921551211370240
812745134244083268221948510644008750782219485106244083268274513419333502096
9119215993329347617651307099824179351871126179351871126513070998243293476176192159931467943326240
1011345120124377324474911179188718326395476382274111462212602806395476382274111791887183243773244749134512012126260827282016
111941584151576565638355234051084145652082652636445705832415964395745832415964395742082652636445702340510841456557656563835594158415111630978951442432
1216591089130755359700389847667080945475463601894166589272707426868463694843226755464090156270742686846369486360189416658927476670809454754755359700389865910891301111064133661777472
1314613762398998644013527290952097419070823418536206058697203511522012022219002312767082955189361980276708295518936198011522012022219002311853620605869720359520974190708234986440135272904613762398918228531764680187520
141322963368008128577976894074718755298011180826452176909651642316734595131173766232264815900237386298732626723822849467906967121615900237386298732626745951311737662322648521769096516423167318755298011180826412857797689407473229633680081658948925976385666432

Generated b-files: A144443, A144443 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-a0dd3d6ef57da7a5 · revision 1 · JSON
Definition source
oeis_catalog:A144443
Fingerprint
f6-d813e141c637fb10

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,       20,          1;
  3: 1,      159,        159,           1;
  4: 1,     1138,       4254,        1138,            1;
  5: 1,     7997,      77878,       77878,         7997,            1;
  6: 1,    56016,    1219167,     2984888,      1219167,        56016,           1;
  7: 1,   392155,   17633649,    87659315,     87659315,     17633649,      392155,          1;
  8: 1,  2745134,  244083268,  2219485106,   4400875078,   2219485106,   244083268,    2745134,        1;
  9: 1, 19215993, 3293476176, 51307099824, 179351871126, 179351871126, 51307099824, 3293476176, 19215993, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(6*n-5)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) + 6*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[(1 + (6*n - 5)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x] + 6*x*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + (6*n - 5)*x)*v[i - 1] + (6*x - 6*x^2)*deriv(v[i - 1], x) + 6*x*v[i - 2]); 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.

A144443: triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,        1;
   3: 1,       20,          1;
   4: 1,      159,        159,           1;
   5: 1,     1138,       4254,        1138,            1;
   6: 1,     7997,      77878,       77878,         7997,            1;
   7: 1,    56016,    1219167,     2984888,      1219167,        56016,           1;
   8: 1,   392155,   17633649,    87659315,     87659315,     17633649,      392155,          1;
   9: 1,  2745134,  244083268,  2219485106,   4400875078,   2219485106,   244083268,    2745134,        1;
  10: 1, 19215993, 3293476176, 51307099824, 179351871126, 179351871126, 51307099824, 3293476176, 19215993, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(6*n-11)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) + 6*x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[(1 + (6*n - 11)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x] + 6*x*P[n - 2, 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; v[2] = 1 + x; for(n = 3, N, my(i = n); v[i] = (1 + (6*n - 11)*x)*v[i - 1] + (6*x - 6*x^2)*deriv(v[i - 1], x) + 6*x*v[i - 2]); 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.

A144443: reversed triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,        1;
   3: 1,       20,          1;
   4: 1,      159,        159,           1;
   5: 1,     1138,       4254,        1138,            1;
   6: 1,     7997,      77878,       77878,         7997,            1;
   7: 1,    56016,    1219167,     2984888,      1219167,        56016,           1;
   8: 1,   392155,   17633649,    87659315,     87659315,     17633649,      392155,          1;
   9: 1,  2745134,  244083268,  2219485106,   4400875078,   2219485106,   244083268,    2745134,        1;
  10: 1, 19215993, 3293476176, 51307099824, 179351871126, 179351871126, 51307099824, 3293476176, 19215993, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(6*n-11)*x)*P(n-1,x) + (6*x-6*x^2)*d/dx P(n-1,x) + 6*x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[(1 + (6*n - 11)*x)*P[n - 1, x] + (6*x - 6*x^2)*D[P[n - 1, x], x] + 6*x*P[n - 2, 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; v[2] = 1 + x; for(n = 3, N, my(i = n); v[i] = (1 + (6*n - 11)*x)*v[i - 1] + (6*x - 6*x^2)*deriv(v[i - 1], x) + 6*x*v[i - 2]); 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-bfe3673616f49c96
  • 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-bfe3673616f49c96
  • 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-bfe3673616f49c96
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-bfe3673616f49c96

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 1 proof step

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