A063967 → x ↦ x−15

OEIS matches ?

No OEIS matches.

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:
   1:            1;
   2:          -14,          1;
   3:          182,        -27,           1;
   4:        -2352,        532,         -40,         1;
   5:        30380,      -9240,        1051,       -53,         1;
   6:      -392392,     149940,      -22862,      1739,       -66,       1;
   7:      5068168,   -2331812,      446054,    -45415,      2596,     -79,       1;
   8:    -65460864,   35221984,    -8106560,   1034656,    -79096,    3622,     -92,    1;
   9:    845497744, -520855104,   140137256, -21509880,   2060241, -126102,    4817, -105,    1;
  10: -10920516320, 7578900560, -2334062864, 418683832, -48211254, 3695865, -188630, 6181, -118, 1;

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

P[1, x_] := 1;
P[2, x_] := -14 + x;
P[n_, x_] := P[n, x] = Expand[-(14 - x)*P[n - 1, x] - (14 - x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

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

Proved properties

• Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (10, 14]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-79b40901050ca651
• Coefficients of one sign. Every nonzero row, n >= 1: the coefficients of P_n(-x) 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-79b40901050ca651
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-79b40901050ca651

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

• preserver_image affine, shift 0 e-79b40901050ca651

  Affine, reversal and Möbius substitutions (elementary) polytool ?

  • premise (sequence): Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
    • theorem_check ma_wang_interval e-32a5b77539bbfdf5 root: theorem check

      Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?

Used in 1 proof step

• e-bfdacf28446aab8d basis_map (A027467) → Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) …

Related sequences ?

No candidate equalities or related sequences.

References

1. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741