A059364 → basis A007318

OEIS matches ?

• A007559: 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:         3,          1;
  2:        15,         11,          2;
  3:       105,        122,         47,          6;
  4:       945,       1518,        911,        242,         24;
  5:     10395,      21423,      17611,       7217,       1474,        120;
  6:    135135,     340869,     357481,     199487,      62464,      10404,       720;
  7:   2027025,    6058980,    7748298,    5494672,    2333369,     593308,     83628,     5040;
  8:  34459425,  119218860,  180192906,  155395808,   83624649,   28753188,   6168140,   754704,   40320;
  9: 654729075, 2575293165, 4496634954, 4574256506, 2987430603, 1298932413, 375973352, 69852636, 7558416, 362880;

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

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n + 1 + n*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] = (2*n + 1 + n*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-6e263990c3c1f7f9
• 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-6e263990c3c1f7f9
• 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-6e263990c3c1f7f9

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 A007318 e-6e263990c3c1f7f9

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-50fc3242d79d4e9a root: theorem check

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

    • basis_map A007318 e-b8821d58f365ef74

      Geometric basis map (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 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 (expanded above)
                • parent_provers paper_theorem e-b29f35705824bef6 root: theorem check

                  Parent-row provers of polytool polytool ?

            • 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 (expanded above)
    • parent_provers root_domain e-bf95690978550a83 root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image affine, shift 0 e-8e142d34c9c1ef70

      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 (expanded above)
        • ↵ preserver_image reversal, shift 0 e-986a227a8a459030 (expanded above)
        • ↵ parent_provers paper_theorem e-b29f35705824bef6 (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