Real-rooted atlas

A317497: Triangle T(n,k) = 3*T(n-1,k) + T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1 and T(n,k) = 0 for n or k < 0, read by rows.

A102547 → x ↦ (1/27)x

A317497 nonnegative coefficients

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

Recurrence from OEIS A317497
\(P_{n}(x) = \left(3\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-3}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3\)
\(P_{2}(x) = 9\)

Rows ?

nx0x1x2Pn(1)
011
133
299
327128
481687
524327270
67291081838
7218740592601

Show all 15 stored rows

Generated b-files: A052541 (row sums), A317497 ?

Computed in your browser ?

Technical details
Node id
n-a5b33928f20c14a2 · revision 1 · JSON
Definition source
oeis_catalog:A317497
Fingerprint
f6-95f9e15614503e31

Observed on the stored rows ?

  • Degrees: 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4 (irregular)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • 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:     3;
  2:     9;
  3:    27,    1;
  4:    81,    6;
  5:   243,   27;
  6:   729,  108,   1;
  7:  2187,  405,   9;
  8:  6561, 1458,  54;
  9: 19683, 5103, 270, 1;
%F Formula
The row polynomials satisfy P(n,x) = 3*P(n-1,x) + x*P(n-3,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3, P(2,x) = 9.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3;
P[2, x_] := 9;
P[n_, x_] := P[n, x] = Expand[3*P[n - 1, x] + x*P[n - 3, 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] = 3; v[3] = 9; for(n = 3, N, my(i = n + 1); v[i] = 3*v[i - 1] + x*v[i - 3]); 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.

A317497: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:     1;
  1:     3;
  2:     9;
  3:    27,    1;
  4:    81,    6;
  5:   243,   27;
  6:   729,  108,   1;
  7:  2187,  405,   9;
  8:  6561, 1458,  54;
  9: 19683, 5103, 270, 1;
%F Formula
The row polynomials satisfy P(n,x) = 3*P(n-1,x) + x*P(n-3,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3, P(2,x) = 9.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3;
P[2, x_] := 9;
P[n_, x_] := P[n, x] = Expand[3*P[n - 1, x] + x*P[n - 3, 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] = 3; v[3] = 9; for(n = 3, N, my(i = n + 1); v[i] = 3*v[i - 1] + x*v[i - 3]); 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.

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-b8d37b5fe37403cf
  • 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-b8d37b5fe37403cf
  • 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-b8d37b5fe37403cf

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 6 proof steps

No candidate equalities or related sequences.