A144440: Triangle T(n,k) by rows: T(n, k) = (3*n-3*k+1)*T(n-1, k-1) +(3*k-2)*T(n-1, k) + 3*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
2111113
3154541110
4122978922911249
5193279757975932117816
613747686281618676862837471306619
7115010543144253475925347595431441501016185828
816006540984393424377866389335342437784098439600651143193901
9124028830055533421937553141856608014185660804219375533005553324028813741598910
101961183216576126489289257326560903881455932825652656090388148928925732165761269611831108935950093
111384476615436668705443349547945420119971812384053930191238405393019454201199718544334954791543666870384476613497175199706
12115379101109277393855882073555287280131661028298865953937434719618478241729886595393743728013166102858820735552810927739385153791011122727939839989
13161516444770285994276225464476825111274818034585661551421424742155794782570732615579478257073266615514214247421112748180345856225464476825770285994276151644414674153239518700
14124606581954152244172064906400366923164132665529776413722358042747336462294540102389736869129288546959546229454010238973137223580427473361641326655297764649064003669235415224417202460658191192008466639786667

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

Computed in your browser ?

Technical details
Node id
n-ef0a5df5e949a196 · revision 1 · JSON
Definition source
oeis_catalog:A144440
Fingerprint
f6-28fef730de5cdff7

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,     11,        1;
  3: 1,     54,       54,         1;
  4: 1,    229,      789,       229,          1;
  5: 1,    932,     7975,      7975,        932,          1;
  6: 1,   3747,    68628,    161867,      68628,       3747,         1;
  7: 1,  15010,   543144,   2534759,    2534759,     543144,     15010,        1;
  8: 1,  60065,  4098439,  34243778,   66389335,   34243778,   4098439,    60065,      1;
  9: 1, 240288, 30055533, 421937553, 1418566080, 1418566080, 421937553, 30055533, 240288, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(3*n-2)*x)*P(n-1,x) + (3*x-3*x^2)*d/dx P(n-1,x) + 3*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 + (3*n - 2)*x)*P[n - 1, x] + (3*x - 3*x^2)*D[P[n - 1, x], x] + 3*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 + (3*n - 2)*x)*v[i - 1] + (3*x - 3*x^2)*deriv(v[i - 1], x) + 3*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.

A144440: triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,      1;
   3: 1,     11,        1;
   4: 1,     54,       54,         1;
   5: 1,    229,      789,       229,          1;
   6: 1,    932,     7975,      7975,        932,          1;
   7: 1,   3747,    68628,    161867,      68628,       3747,         1;
   8: 1,  15010,   543144,   2534759,    2534759,     543144,     15010,        1;
   9: 1,  60065,  4098439,  34243778,   66389335,   34243778,   4098439,    60065,      1;
  10: 1, 240288, 30055533, 421937553, 1418566080, 1418566080, 421937553, 30055533, 240288, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(3*n-5)*x)*P(n-1,x) + (3*x-3*x^2)*d/dx P(n-1,x) + 3*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 + (3*n - 5)*x)*P[n - 1, x] + (3*x - 3*x^2)*D[P[n - 1, x], x] + 3*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 + (3*n - 5)*x)*v[i - 1] + (3*x - 3*x^2)*deriv(v[i - 1], x) + 3*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.

A144440: reversed triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,      1;
   3: 1,     11,        1;
   4: 1,     54,       54,         1;
   5: 1,    229,      789,       229,          1;
   6: 1,    932,     7975,      7975,        932,          1;
   7: 1,   3747,    68628,    161867,      68628,       3747,         1;
   8: 1,  15010,   543144,   2534759,    2534759,     543144,     15010,        1;
   9: 1,  60065,  4098439,  34243778,   66389335,   34243778,   4098439,    60065,      1;
  10: 1, 240288, 30055533, 421937553, 1418566080, 1418566080, 421937553, 30055533, 240288, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(3*n-5)*x)*P(n-1,x) + (3*x-3*x^2)*d/dx P(n-1,x) + 3*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 + (3*n - 5)*x)*P[n - 1, x] + (3*x - 3*x^2)*D[P[n - 1, x], x] + 3*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 + (3*n - 5)*x)*v[i - 1] + (3*x - 3*x^2)*deriv(v[i - 1], x) + 3*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-8f7192735b9d8398
  • 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-8f7192735b9d8398
  • 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-8f7192735b9d8398
  • 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-8f7192735b9d8398

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