A088996 → basis A013609

OEIS matches ?

• A008545: row sums, 15 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:
  0:        1;
  1:        1,         2;
  2:        3,        10,          8;
  3:       15,        68,        100,         48;
  4:      105,       596,       1244,       1136,        384;
  5:      945,      6414,      17156,      22664,      14816,        3840;
  6:    10395,     81894,     265684,     455176,     434944,      220032,      46080;
  7:   135135,   1210152,    4600408,    9636864,   12026736,     8949632,    3679488,     645120;
  8:  2027025,  20314440,   88368552,  218159488,  334590864,   326672256,  198386432,   68548608,   10321920;
  9: 34459425, 381831930, 1867925304, 5299345232, 9614915472, 11576063904, 9252669952, 4736282112, 1409347584, 185794560;

The row polynomials satisfy P(n,x) = (2*n-1+2*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 + 2*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 + 2*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-0f361da4a6c0f5b4
• 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-0f361da4a6c0f5b4
• 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-0f361da4a6c0f5b4

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 A013609 e-0f361da4a6c0f5b4

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers root_domain e-4c0875826685c298 root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image mobius, shift 0 e-e5c0b6618046e013

      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 root: theorem check

          Parent-row provers of polytool polytool ?

Related sequences ?

Same fingerprint (1)

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

• A109692 → basis A007318