A118931 → basis A013609

OEIS matches ?

• A118395: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?

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.

Triangle begins:
  0:    1;
  1:    1;
  2:    1;
  3:    3,     4;
  4:    9,    16;
  5:   21,    40;
  6:   81,   240,   160;
  7:  351,  1260,  1120;
  8: 1233,  4704,  4480;
  9: 5769, 27216, 40320, 17920;

The row polynomials satisfy P(n,x) = (n^2-3*n+2+(2*n^2-6*n+4)*x)*P(n-3,x) + P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1.

P[0, x_] := 1;
P[1, x_] := 1;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n^2 - 3*n + 2 + (2*n^2 - 6*n + 4)*x)*P[n - 3, x] + P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = (n^2 - 3*n + 2 + (2*n^2 - 6*n + 4)*x)*v[i - 3] + v[i - 1]); 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)

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-9ee18672ede43293
• 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-9ee18672ede43293
• 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-9ee18672ede43293
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-9ee18672ede43293

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

• basis_map A013609 e-9ee18672ede43293

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers paper_theorem e-340a6e5084723b41 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

No candidate equalities or related sequences.