A136124 → basis A013611

OEIS matches ?

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

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:        3,         4;
  2:       12,        28,        16;
  3:       60,       188,       192,        64;
  4:      360,      1368,      1904,      1152,       256;
  5:     2520,     11016,     18800,     15680,      6400,      1024;
  6:    20160,     98208,    194464,    200640,    113920,     33792,      4096;
  7:   181440,    964512,   2143008,   2583616,   1827840,    759808,    172032,    16384;
  8:  1814400,  10370880,  25288128,  34408192,  28612864,  14909440,   4759552,   851968,   65536;
  9: 19958400, 121337280, 319652928, 479642624, 452374272, 278455296, 111992832, 28409856, 4128768, 262144;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 2 + 4*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 2 + 4*x)*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-de8013a655bc6eea
• 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-de8013a655bc6eea
• 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-de8013a655bc6eea

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 A013611 e-de8013a655bc6eea

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-ab2b07f2d97ec943 root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

    • basis_map A007318 e-ed30910ee779b0d9

      Geometric basis map (elementary) polytool ?

      • premise (sequence): Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check liu_wang e-5f21311bb67f8c1c root: theorem check

          Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

        • basis_map A007318 e-0b3ba9047fae59ed

          Geometric basis map (elementary) polytool ?

          • premise (sequence): Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • parent_provers root_domain e-edbf92ee2e446027 root: theorem check

              Parent-row provers of polytool polytool ?

        • parent_provers root_domain e-2e5c10abc86c264d root: theorem check

          Parent-row provers of polytool polytool ?

        • preserver_image reversal, shift 0 e-90e69a839bdbf74b

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

          • premise (sequence): Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • theorem_check liu_wang e-419a6747cb084155 root: theorem check

              Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

            • preserver_image reversal, shift 0 e-986a227a8a459030

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

              • premise (sequence): Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
                uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
                • ↵ theorem_check liu_wang e-5f21311bb67f8c1c (expanded above)
                • ↵ basis_map A007318 e-0b3ba9047fae59ed (expanded above)
                • ↵ parent_provers root_domain e-2e5c10abc86c264d (expanded above)
                • preserver_image affine, shift 0 e-1ba7a8eebd893648

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

                  • premise (sequence): Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
                    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
                    • ↵ parent_provers root_domain e-edbf92ee2e446027 (expanded above)
            • parent_provers paper_theorem e-b29f35705824bef6 root: theorem check

              Parent-row provers of polytool polytool ?

        • ↵ preserver_image affine, shift 0 e-1ba7a8eebd893648 (expanded above)
    • parent_provers root_domain e-f17aff623964d25a root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image affine, shift 0 e-ea4f969963775c13

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

      • premise (sequence): Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check liu_wang e-5f21311bb67f8c1c (expanded above)
        • ↵ basis_map A007318 e-0b3ba9047fae59ed (expanded above)
        • ↵ parent_provers root_domain e-2e5c10abc86c264d (expanded above)
        • ↵ preserver_image reversal, shift 0 e-90e69a839bdbf74b (expanded above)
        • ↵ preserver_image affine, shift 0 e-1ba7a8eebd893648 (expanded above)

Related sequences ?

Same fingerprint (1)

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

• A143491 → basis A013611

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