basis-map coefficients of A297191, shifted → θ+1

OEIS matches ?

• A089684: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A105356: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A060747: row sums, 15 terms agree (row-sum match: finite agreement only) · view at the OEIS
• A033041: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A004273: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A053229: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
• A176271: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
• A005408: 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: 0, 0, 3;
  2: 0, 0, 0, 0, 5;
  3: 0, 0, 0, 0, 0, 0, 7;
  4: 0, 0, 0, 0, 0, 0, 0, 0, 9;
  5: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11;
  6: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0, 0, 13;
  7: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0, 0,  0, 0, 15;
  8: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0, 0,  0, 0,  0, 0, 17;
  9: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0, 0,  0, 0,  0, 0,  0, 0, 19;

The row polynomials satisfy (2*n-1)*P(n,x) = (2*n+1)*x^2*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 + 1)*x^2*P[n - 1, x])/(2*n - 1)]];
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)*x^2*v[i - 1])/(2*n - 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-5ff024f1a04a7dc8
• 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-5ff024f1a04a7dc8
• 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-5ff024f1a04a7dc8

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 euler_polynomial, shift 0 e-5ff024f1a04a7dc8

  Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?

  • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • parent_provers periodic_product e-1991a148b9538b93 root: theorem check

      Parent-row provers of polytool polytool ?

    • preserver_image mobius, shift 0 e-12303ad0e0b9f8eb

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

      • premise (sequence): basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ parent_provers periodic_product e-1991a148b9538b93 (expanded above)

Related sequences ?

Same fingerprint (75)

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

• basis-map coefficients of A021012 → reverse
• A127733: Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
• basis-map coefficients of A112227 → θ+1
• A130123 → θ+1
• A178822 → γ
• basis-map coefficients of A026729 → (θ+1)²
• basis-map coefficients of A112227 → D
• basis-map coefficients of A026729, shifted → reverse
• A130123 → D
• basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
• A038338 → γ
• A136572 → D
• basis-map coefficients of A030528, shifted → reverse
• A010054: a(n) = 1 if n is a triangular number, otherwise 0.
• A038221 → γ
• basis-map coefficients of A021012 → D
• A133080 → Veronese 2
• basis-map coefficients of A030528, shifted → (θ+1)²
• A135838 → γ
• basis-map coefficients of A297191, shifted → (θ+1)²
• A023531 → (θ+1)² → θ+1
• basis-map coefficients of A026729, shifted → (θ+1)²
• A136572 → θ+1
• A344565 → γ
• A023531 → (θ+1)² → (θ+1)²
• basis-map coefficients of A scaled Hermite triangle.
• A156992 → γ
• A010054 → reverse → D
• A136572 → (θ+1)²
• A178820 → γ
• A023531: a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
• basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
• A010054 → reverse → reverse
• A010054 → reverse → D
• basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
• basis-map coefficients of A030528, shifted → D
• basis-map coefficients of A297191, shifted → D
• A023531 → (θ+1)² → reverse
• A132440: Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the clas…
• A010054 → reverse → θ+1
• basis-map coefficients of A021012 → θ+1
• A010054 → reverse → θ+1
• A028326 → γ
• basis-map coefficients of Triangle of coefficients in expansion of x^n in terms of Laguerre polynomials L_n(x).
• A136572: Triangle read by rows: row n consists of n zeros followed by n!.
• A023531 → 2D+1+2n → Veronese 2
• A127648: Triangle read by rows: row n consists of n zeros followed by n+1.
• basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
• A198954: Expansion of the rotational partition function for a heteronuclear diatomic molecule.
• A356546 → γ
• basis-map coefficients of A021012 → (θ+1)²
• A010054 → reverse → reverse
• A130123: Infinite lower triangular matrix with 2^k in the right diagonal and the rest zeros. Triangle, T(n,k), n zeros …
• A038325 → γ
• A010054 → reverse → θ+1
• A131431: 3n + 1 preceded by n zeros.
• basis-map coefficients of A026729 → D
• A130123 → (θ+1)²
• A178821 → γ
• A023531 → θ+1
• A085881 → γ
• A196347 → γ
• A130123 → reverse
• basis-map coefficients of A030528, shifted → θ+1
• A023531 → 2D+1+2n → Veronese 2 (j=1)
• A007318 → D → γ
• basis-map coefficients of A026729, shifted → D
• A023531 → (θ+1)² → D
• A127773: Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.
• basis-map coefficients of A112227 → (θ+1)²
• A023531 → D → (θ+1)²
• A010054 → reverse → (θ+1)²
• A010054 → reverse → D
• basis-map coefficients of A026729, shifted → θ+1
• A010054 → reverse → (θ+1)²

References

1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.