A013622 → Pₙ + Pₙ₊₁

nonnegative coefficients only rational roots

Proved for all n: all roots real what this means

Recurrence

\(P_{n}(x) = \left(3 + 5\,x\right)\,P_{n-1}(x)\)

\(P_{0}(x) = 4 + 5\,x\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	x⁸	P_n(1)
0	4	5								9
1	12	35	25							72
2	36	165	250	125						576
3	108	675	1575	1625	625					4608
4	324	2565	8100	12750	10000	3125				36864
5	972	9315	37125	78750	93750	59375	15625			294912
6	2916	32805	157950	421875	675000	646875	343750	78125		2359296
7	8748	112995	637875	2055375	4134375	5315625	4265625	1953125	390625	18874368

Show all 15 stored rows

Computed in your browser ?

Technical details

Node id: n-8ae41b2ed712d989 · revision 1 · JSON
Definition source: derived:obreschkoff_combination
Fingerprint: f6-ee71b88eaf7760c9

Observed on the stored rows ?

Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 ℚ): yes

OEIS matches ?

A168782: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168830: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168878: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A167900: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168734: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168686: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A003951: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168926: 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.

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

%e Example

Triangle begins:
  0:     4,       5;
  1:    12,      35,      25;
  2:    36,     165,     250,      125;
  3:   108,     675,    1575,     1625,       625;
  4:   324,    2565,    8100,    12750,     10000,      3125;
  5:   972,    9315,   37125,    78750,     93750,     59375,     15625;
  6:  2916,   32805,  157950,   421875,    675000,    646875,    343750,     78125;
  7:  8748,  112995,  637875,  2055375,   4134375,   5315625,   4265625,   1953125,    390625;
  8: 26244,  382725, 2478600,  9355500,  22680000,  36618750,  39375000,  27187500,  10937500,  1953125;
  9: 78732, 1279395, 9349425, 40459500, 114817500, 223256250, 301218750, 278437500, 168750000, 60546875, 9765625;

%F Formula

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

%t Mathematica

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

%o PARI/GP

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

Generated with polytool c48629374597.

Proved properties

Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
Every polynomial of the sequence has only real roots, inside the stated interval.

by the cited steps: e-19ee20f31e12280f

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

obreschkoff_combination e-19ee20f31e12280f

Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
- premise (sequence): Triangle of coefficients in expansion of (3+5x)^n.
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
  - theorem_check liu_wang e-9aec8f9af8bb24ea root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
  - parent_provers periodic_product e-abc3ddb24ba116e8 root: theorem check
    
    Parent-row provers of polytool polytool ?
  - preserver_image mobius, shift 0 e-a28ac028c491cc22
    
    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 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)
- premise (sequence): Triangle of coefficients in expansion of (3+5x)^n.
  uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  
  no recorded property covers this requirement

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
[Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
[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
[Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.