A001263 → basis A013610

OEIS matches ?

• A059231: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A127846: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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:     2,      3;
  2:     5,     15,       9;
  3:    14,     63,      81,      27;
  4:    42,    252,     504,     378,      81;
  5:   132,    990,    2700,    3240,    1620,     243;
  6:   429,   3861,   13365,   22275,   18225,    6561,     729;
  7:  1430,  15015,   63063,  135135,  155925,   93555,   25515,    2187;
  8:  4862,  58344,  288288,  756756, 1135134,  972972,  449064,   96228,   6561;
  9: 16796, 226746, 1288872, 4009824, 7429968, 8358714, 5572476, 2047032, 354294, 19683;

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

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

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

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

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 A013610 e-ef158e576c5477a7

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-d285019b29e04549 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • preserver_image reversal, shift 0 e-14da04f2a2dce119

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

      • premise (sequence): Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check three_term_recurrence e-d285019b29e04549 (expanded above)

Related sequences ?

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

• narayana → basis A013610

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023