A026729 → x ↦ x/(x+1)

OEIS matches ?

• A152046: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A001045: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A168642: row sums, 12 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A167167: row sums, 15 terms agree (row-sum match: finite agreement only) · view at the OEIS
• A128100: reversed 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 = 0 ?
• A111006: triangle, 78 terms agree, 12 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?
• A283642: row sums, 14 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:
   1: 1;
   2: 0, 1;
   3: 0, 1, 2;
   4: 0, 0, 2, 3;
   5: 0, 0, 1, 5,  5;
   6: 0, 0, 0, 3, 10,  8;
   7: 0, 0, 0, 1,  9, 20, 13;
   8: 0, 0, 0, 0,  4, 22, 38,  21;
   9: 0, 0, 0, 0,  1, 14, 51,  71,  34;
  10: 0, 0, 0, 0,  0,  5, 40, 111, 130, 55;

The row polynomials satisfy (n-1+(2*n-2)*x+(n-1)*x^2)*P(n,x) = -(2*n-4+(10*n-21)*x+(19*n-40)*x^2+(16*n-33)*x^3+(5*n-10)*x^4)*P(n-1,x) + (4*x+17*x^2+27*x^3+19*x^4+5*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 4 + (10*n - 21)*x + (19*n - 40)*x^2 + (16*n - 33)*x^3 + (5*n - 10)*x^4)*P[n - 1, x] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*D[P[n - 1, x], x])/(n - 1 + (2*n - 2)*x + (n - 1)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(2*n - 4 + (10*n - 21)*x + (19*n - 40)*x^2 + (16*n - 33)*x^3 + (5*n - 10)*x^4)*v[i - 1] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*deriv(v[i - 1], x))/(n - 1 + (2*n - 2)*x + (n - 1)*x^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)

Triangle begins:
  0: 1;
  1: 0, 1;
  2: 0, 1, 2;
  3: 0, 0, 2, 3;
  4: 0, 0, 1, 5,  5;
  5: 0, 0, 0, 3, 10,  8;
  6: 0, 0, 0, 1,  9, 20, 13;
  7: 0, 0, 0, 0,  4, 22, 38,  21;
  8: 0, 0, 0, 0,  1, 14, 51,  71,  34;
  9: 0, 0, 0, 0,  0,  5, 40, 111, 130, 55;

The row polynomials satisfy (n+2*n*x+n*x^2)*P(n,x) = -(2*n-2+(10*n-11)*x+(19*n-21)*x^2+(16*n-17)*x^3+(5*n-5)*x^4)*P(n-1,x) + (4*x+17*x^2+27*x^3+19*x^4+5*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 2 + (10*n - 11)*x + (19*n - 21)*x^2 + (16*n - 17)*x^3 + (5*n - 5)*x^4)*P[n - 1, x] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*D[P[n - 1, x], x])/(n + 2*n*x + n*x^2)]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(2*n - 2 + (10*n - 11)*x + (19*n - 21)*x^2 + (16*n - 17)*x^3 + (5*n - 5)*x^4)*v[i - 1] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*deriv(v[i - 1], x))/(n + 2*n*x + n*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Triangle begins:
  0:  1;
  1:  1;
  2:  2,   1;
  3:  3,   2;
  4:  5,   5,   1;
  5:  8,  10,   3;
  6: 13,  20,   9,  1;
  7: 21,  38,  22,  4;
  8: 34,  71,  51, 14, 1;
  9: 55, 130, 111, 40, 5;

Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where (n+2*n*x+n*x^2)*P(n,x) = -(2*n-2+(10*n-11)*x+(19*n-21)*x^2+(16*n-17)*x^3+(5*n-5)*x^4)*P(n-1,x) + (4*x+17*x^2+27*x^3+19*x^4+5*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 2 + (10*n - 11)*x + (19*n - 21)*x^2 + (16*n - 17)*x^3 + (5*n - 5)*x^4)*P[n - 1, x] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*D[P[n - 1, x], x])/(n + 2*n*x + n*x^2)]];
Table[Reverse[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x]], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(2*n - 2 + (10*n - 11)*x + (19*n - 21)*x^2 + (16*n - 17)*x^3 + (5*n - 5)*x^4)*v[i - 1] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*deriv(v[i - 1], x))/(n + 2*n*x + n*x^2)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c = Vecrev(c); 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 >= 1, is zero or real-rooted with all roots in [-1, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-3f0133638547078b
• Coefficients of one sign. Every nonzero row, n >= 1: 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-3f0133638547078b
• Hadamard kernel (Malo). Rows P_n, n >= 1, 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-3f0133638547078b

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 mobius, shift 0 e-3f0133638547078b

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

  • premise (sequence): Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • preserver_image reversal, shift -1 e-24564bef34b2c2e5

      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)
    • basis_map A007318 e-fcd19baf8f835cf0

      Geometric basis map (elementary) polytool ?

      • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 1]
        • preserver_image affine, shift 0 e-1365676e8cb0fd13

          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 ?

        • preserver_image affine, shift 0 e-3c4e27dedb9c54a8

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

          • premise (sequence): Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0]
            • theorem_check ma_wang_interval e-0178a3d1cd265fb6 root: theorem check

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

    • basis_map A026729 e-fa68694d112454ed

      Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?

      • premise (sequence): basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in [0, 0]
        no recorded property covers this requirement
    • ↵ theorem_check ma_wang_interval e-0178a3d1cd265fb6 (expanded above)

Related sequences ?

Same fingerprint (4)

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

• A128100: Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and…
• A030528 → x ↦ x/(x+1)
• A169803 → x ↦ x+1
• A052553 → x ↦ x+1

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
2. [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