A038220 → Veronese 2 (j=1)

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

Recurrence

\(P_{n}(x) = \left(6\right)\,P_{n-1}(x) + \left(-9 + 4\,x\right)\,P_{n-2}(x)\)

\(P_{0}(x) = 0\)

\(P_{1}(x) = 2\)

Rows ?

n	x⁰	x¹	x²	x³	P_n(1)
0					0
1	2				2
2	12				12
3	54	8			62
4	216	96			312
5	810	720	32		1562
6	2916	4320	576		7812
7	10206	22680	6048	128	39062

Show all 15 stored rows

Generated b-files: A121177 (row sums), A125831 (row sums) ?

Computed in your browser ?

Technical details

Node id: n-7e99bca717f629d0 · revision 1 · JSON
Definition source: derived:veronese_section_2_1
Fingerprint: f6-cb7d6555cacb629d

Observed on the stored rows ?

Degrees: -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6 (half affine: slope 1, intercept -1)
Palindromic rows: no
γ-positive (gamma_positive): no
Nonnegative coefficients (nonn): yes
Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

OEIS matches ?

A125831: 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 ?
A121177: 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 ?

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.

The atlas's own rows: n = 0, …, ascending powers of x

%e Example

Triangle begins:
  0:      0;
  1:      2;
  2:     12;
  3:     54,      8;
  4:    216,     96;
  5:    810,    720,     32;
  6:   2916,   4320,    576;
  7:  10206,  22680,   6048,   128;
  8:  34992, 108864,  48384,  3072;
  9: 118098, 489888, 326592, 41472, 512;

%F Formula

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

%t Mathematica

P[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[6*P[n - 1, x] - (9 - 4*x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

%o PARI/GP

P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = 6*v[i - 1] - (9 - 4*x)*v[i - 2]); 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)

Generated with polytool c48629374597.

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-252e19fd44a7da1c
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-252e19fd44a7da1c
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-252e19fd44a7da1c

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

veronese_section r=2, j=1, shift 0 e-252e19fd44a7da1c

Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
- premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*2^j.
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
  - theorem_check liu_wang e-1bc008755d2fc1a6 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
  - basis_map A007318 e-01e7c46c78122cbc
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+2*x)^n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-a6866143cc223753 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    basis_map A013609 e-41b2234a78052e4f
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    veronese_section r=2, j=0, shift 0 e-292206ad4ae86d2d
    
    Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] 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)
    
    parent_provers periodic_product e-b7eca039219a7f53 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image mobius, shift 0 e-7e44b66e04c497d6
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ veronese_section r=2, j=0, shift 0 e-292206ad4ae86d2d (expanded above)
    
    ↵ parent_provers periodic_product e-b7eca039219a7f53 (expanded above)
    
    gamma_polynomial scale 1, shift 0 e-4c4f74d9ba733cff
    
    Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
    
    premise (sequence): Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    parent_provers periodic_product e-eab26daf7024ea74 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image reversal, shift 0 e-6d15baf5e54583ee
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-0d085d05819c04f2 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    preserver_image reversal, shift 0 e-045f9d56b54ceaf2
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+2*x)^n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-a6866143cc223753 (expanded above)
    
    ↵ basis_map A013609 e-41b2234a78052e4f (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-4c4f74d9ba733cff (expanded above)
    
    parent_provers periodic_product e-d08b7f9df01d4f3c root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image mobius, shift 0 e-2c323256b27180b8
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): binomial
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-317eb4ccca60c6ac root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    preserver_image reversal, shift 0 e-033cf842aad3bdf7
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): binomial
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-317eb4ccca60c6ac (expanded above)
    
    basis_map A007318 e-095baa2a9dfe188f
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ veronese_section r=2, j=0, shift 0 e-292206ad4ae86d2d (expanded above)
    
    ↵ parent_provers periodic_product e-b7eca039219a7f53 (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-7e44b66e04c497d6 (expanded above)
    
    parent_provers periodic_product e-13983862a411779c root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image reversal, shift 0 e-989c95e5c893fce9
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Riordan array (1-x,x/(1-x)).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    parent_provers periodic_product e-b62074ba45057e82 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    gamma_polynomial scale 1, shift 0 e-c76adc2a99cd3dea
    
    Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
    
    premise (sequence): Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    preserver_image reversal, shift 0 e-0e058c428dfdfeb6
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    parent_provers periodic_product e-d82c9b48e4b31a6b root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    ↵ parent_provers periodic_product e-d82c9b48e4b31a6b (expanded above)
    
    preserver_image affine, shift 0 e-3a52de7742ed9314
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ veronese_section r=2, j=0, shift 0 e-292206ad4ae86d2d (expanded above)
    
    ↵ parent_provers periodic_product e-b7eca039219a7f53 (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-7e44b66e04c497d6 (expanded above)
    
    ↵ basis_map A007318 e-095baa2a9dfe188f (expanded above)
    
    ↵ parent_provers periodic_product e-13983862a411779c (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-989c95e5c893fce9 (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-c76adc2a99cd3dea (expanded above)
    
    ↵ preserver_image affine, shift 0 e-3a52de7742ed9314 (expanded above)
    
    parent_provers periodic_product e-1697ba43e31b7729 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-4608a916413bc814
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): binomial
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-317eb4ccca60c6ac (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-033cf842aad3bdf7 (expanded above)
    
    ↵ basis_map A007318 e-095baa2a9dfe188f (expanded above)
    
    ↵ parent_provers periodic_product e-13983862a411779c (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-989c95e5c893fce9 (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-c76adc2a99cd3dea (expanded above)
    
    ↵ preserver_image affine, shift 0 e-3a52de7742ed9314 (expanded above)
    
    preserver_image affine, shift 0 e-17c52917511dc051
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): binomial
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-317eb4ccca60c6ac (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-033cf842aad3bdf7 (expanded above)
    
    ↵ basis_map A007318 e-095baa2a9dfe188f (expanded above)
    
    ↵ parent_provers periodic_product e-13983862a411779c (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-989c95e5c893fce9 (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-c76adc2a99cd3dea (expanded above)
    
    ↵ preserver_image affine, shift 0 e-3a52de7742ed9314 (expanded above)
    
    ↵ parent_provers periodic_product e-d08b7f9df01d4f3c (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-2c323256b27180b8 (expanded above)
  - basis_map A013609 e-715b5f861d0b7004
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-0d085d05819c04f2 (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-045f9d56b54ceaf2 (expanded above)
    
    ↵ parent_provers periodic_product e-1697ba43e31b7729 (expanded above)
    
    ↵ basis_map A007318 e-4608a916413bc814 (expanded above)
    
    ↵ preserver_image affine, shift 0 e-17c52917511dc051 (expanded above)
  - parent_provers periodic_product e-71e0b3707c4ee7db root: theorem check
    
    Parent-row provers of polytool polytool ?
  - preserver_image reversal, shift 0 e-dc7bfe74658d97ca
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (2+3x)^n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-0ecfea69e82c3845 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-31e5a5a6b5727160 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image reversal, shift 0 e-cb393d3715764915
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*2^j.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-1bc008755d2fc1a6 (expanded above)
    
    ↵ basis_map A007318 e-01e7c46c78122cbc (expanded above)
    
    ↵ basis_map A013609 e-715b5f861d0b7004 (expanded above)
    
    ↵ parent_provers periodic_product e-71e0b3707c4ee7db (expanded above)
    
    preserver_image affine, shift 0 e-2582f481aa50840b
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+2*x)^n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-a6866143cc223753 (expanded above)
    
    ↵ basis_map A013609 e-41b2234a78052e4f (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-4c4f74d9ba733cff (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-6d15baf5e54583ee (expanded above)
    
    ↵ parent_provers periodic_product e-d08b7f9df01d4f3c (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-2c323256b27180b8 (expanded above)
    
    basis_map A013610 e-e9dcc990956c90e9
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): binomial
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-317eb4ccca60c6ac (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-033cf842aad3bdf7 (expanded above)
    
    ↵ basis_map A007318 e-095baa2a9dfe188f (expanded above)
    
    ↵ parent_provers periodic_product e-13983862a411779c (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-989c95e5c893fce9 (expanded above)
    
    ↵ gamma_polynomial scale 1, shift 0 e-c76adc2a99cd3dea (expanded above)
    
    ↵ preserver_image affine, shift 0 e-3a52de7742ed9314 (expanded above)
    
    preserver_image mobius, shift 0 e-57079e0e5fed1718
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-0d085d05819c04f2 (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-045f9d56b54ceaf2 (expanded above)
    
    ↵ parent_provers periodic_product e-1697ba43e31b7729 (expanded above)
    
    ↵ basis_map A007318 e-4608a916413bc814 (expanded above)
    
    ↵ preserver_image affine, shift 0 e-17c52917511dc051 (expanded above)
  - ↵ preserver_image affine, shift 0 e-2582f481aa50840b (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

[ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
[AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
[Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
[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