A105070: T(n,k) = 2^k*binomial(n,2k+1), where 0 <= k <= floor((n-1)/2), n >= 1.

OEIS matches ?

• A000129: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A105070: triangle, 64 terms agree, 15 full rows row lengths from the atlas (tabf) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 992 terms from n = 1 ?
• A069306: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 2 ?
• A215928: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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:  2;
  2:  3,   2;
  3:  4,   8;
  4:  5,  20,    4;
  5:  6,  40,   24;
  6:  7,  70,   84,   8;
  7:  8, 112,  224,  64;
  8:  9, 168,  504, 288,  16;
  9: 10, 240, 1008, 960, 160;

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

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

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

Triangle begins:
   1:  1;
   2:  2;
   3:  3,   2;
   4:  4,   8;
   5:  5,  20,    4;
   6:  6,  40,   24;
   7:  7,  70,   84,   8;
   8:  8, 112,  224,  64;
   9:  9, 168,  504, 288,  16;
  10: 10, 240, 1008, 960, 160;

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

P[1, x_] := 1;
P[2, x_] := 2;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - (1 - 2*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] = 2; for(n = 3, N, my(i = n); v[i] = 2*v[i - 1] - (1 - 2*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 >= 0, is zero or real-rooted with all roots in (-inf, 1/2]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-46cbbc49f6ae8edc

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-46cbbc49f6ae8edc

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

  • premise (sequence): Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers paper_theorem e-0801036cdfff24d2 root: theorem check

      Parent-row provers of polytool polytool ?

    • parent_provers paper_theorem e-0d3631d0f359c9ce root: theorem check

      Parent-row provers of polytool polytool ?

    • gamma_polynomial scale 1, shift 0 e-a039cba7823b0b25

      Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?

      • premise (sequence): delannoy
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check liu_wang_derivative_lag e-15c233e4385971d1 root: theorem check

          Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?

        • preserver_image reversal, shift 0 e-266d85ca03a298fa

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

          • premise (sequence): delannoy
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ theorem_check liu_wang_derivative_lag e-15c233e4385971d1 (expanded above)
            • basis_map A008288 e-e771e35dc9ee3fbd

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
            • basis_map A008288 e-33dba7e79fe9caa8

              Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

              • premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]
                no recorded property covers this requirement
        • ↵ basis_map A008288 e-e771e35dc9ee3fbd (expanded above)
        • ↵ basis_map A008288 e-33dba7e79fe9caa8 (expanded above)

Related sequences ?

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