A204420 → basis A013610

OEIS matches ?

• A327882: 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:                1,                3;
  2:                9,               36,                27;
  3:              225,             1035,              1215,               405;
  4:            11025,            55440,             81270,             45360,              8505;
  5:           893025,          4788315,           8079750,           5868450,           1913625,           229635;
  6:        108056025,        608855940,        1135664145,         976714200,         425207475,         90935460,          7577955;
  7:      18261468225,     107110838835,      215672622165,      209355601455,      109951917075,      31951184265,       4827157335,       295540245;
  8:    4108830350625,   24921704808000,    53346327734700,    56810278324800,    34160183407350,   12136852728000,    2523913692300,    283718635200,    13299311025;
  9: 1187451971330625, 7411923037393875, 16688095660536300, 19138833150336900, 12769617199288950, 5249719792166850, 1348390546202700, 210714283880100, 18313151281425, 678264862275;

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

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

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 A013610 e-afc618911e5721d2

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers root_domain e-8239b1c6b4764045 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

No candidate equalities or related sequences.