A038303 → Pₙ + Pₙ₊₁

nonnegative coefficients only rational roots

Proved for all n: all roots real what this means

Recurrence

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

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

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	x⁸	x⁹	x¹⁰	x¹¹	x¹²	x¹³	x¹⁴	x¹⁵	P_n(1)
0	11	1															12
1	110	21	1														132
2	1100	320	31	1													1452
3	11000	4300	630	41	1												15972
4	110000	54000	10600	1040	51	1											175692
5	1100000	650000	160000	21000	1550	61	1										1932612
6	11000000	7600000	2250000	370000	36500	2160	71	1									21258732
7	110000000	87000000	30100000	5950000	735000	58100	2870	81	1								233846052
8	1100000000	980000000	388000000	89600000	13300000	1316000	86800	3680	91	1							2572306572
9	11000000000	10900000000	4860000000	1284000000	222600000	26460000	2184000	123600	4590	101	1						28295372292
10	110000000000	120000000000	59500000000	17700000000	3510000000	487200000	48300000	3420000	169500	5600	111	1					311249095212
11	1100000000000	1310000000000	715000000000	236500000000	52800000000	8382000000	970200000	82500000	5115000	225500	6710	121	1				3423740047332
12	11000000000000	14200000000000	8460000000000	3080000000000	764500000000	136620000000	18084000000	1795200000	133650000	7370000	292600	7920	131	1			37661140520652
13	110000000000000	153000000000000	98800000000000	39260000000000	10725000000000	2130700000000	317460000000	36036000000	3131700000	207350000	10296000	371800	9230	141	1		414272545727172
14	1100000000000000	1640000000000000	1141000000000000	491400000000000	146510000000000	32032000000000	5305300000000	677820000000	67353000000	5205200000	310310000	14014000	464100	10640	151	1	4556998002998892

Computed in your browser ?

Technical details

Node id: n-37c70c80fa31c1b5 · revision 1 · JSON
Definition source: derived:obreschkoff_combination
Fingerprint: f6-ee779bc3aafd2f30

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 ?

A168929: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168785: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A003954: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168737: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168881: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168833: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A168689: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A167916: 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:          11,           1;
  1:         110,          21,          1;
  2:        1100,         320,         31,          1;
  3:       11000,        4300,        630,         41,         1;
  4:      110000,       54000,      10600,       1040,        51,        1;
  5:     1100000,      650000,     160000,      21000,      1550,       61,       1;
  6:    11000000,     7600000,    2250000,     370000,     36500,     2160,      71,      1;
  7:   110000000,    87000000,   30100000,    5950000,    735000,    58100,    2870,     81,    1;
  8:  1100000000,   980000000,  388000000,   89600000,  13300000,  1316000,   86800,   3680,   91,   1;
  9: 11000000000, 10900000000, 4860000000, 1284000000, 222600000, 26460000, 2184000, 123600, 4590, 101, 1;

%F Formula

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

%t Mathematica

P[0, x_] := 11 + x;
P[n_, x_] := P[n, x] = Expand[(10 + 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] = 11 + x; for(n = 1, N, my(i = n + 1); v[i] = (10 + 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-e361768fdb02a8d8

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-e361768fdb02a8d8

Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
- premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j.
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
  - theorem_check liu_wang e-628c0d5ad874b82a root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
  - basis_map A007318 e-28dc2c43b415fad4
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-c055c0541343b096 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-6d834ef5c24f37f2 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-a986b288b7f6003d
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-b6a9810385e1026e root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    basis_map A007318 e-403b5075da2bf036
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*7^(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-c0e43064b314c6c0 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-7e8833b30e1c308e root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-cffbbf28e801bdbf
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*6^(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-29094c360cdb0314 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-e8d1c828e3ebc417 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-efe1634c04c9236a
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is 5^(i-j)*binomial(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-f2f89dae9298aff8 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-868f364735375874 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-8f220a12633250f0
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*4^(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-2d1c3ef96dc1c123 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    preserver_image reversal, shift 0 e-6e49a6f9dd41e218
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+4x)^n.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-f45969f98fa0cee8 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    parent_provers periodic_product e-36f1e280ef03dec1 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image reversal, shift 0 e-8a33d9f811421624
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*4^(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-2d1c3ef96dc1c123 (expanded above)
    
    basis_map A007318 e-9f0b70d11cb8d495
    
    Geometric basis map (elementary) polytool ?
    
    premise (sequence): Cube of lower triangular normalized binomial matrix.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    theorem_check liu_wang e-2786234a932620b2 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    preserver_image reversal, shift 0 e-090c65763405a203
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+3*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-035d18f235569c81 root: theorem check
    
    Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
    
    basis_map A013610 e-404109e50a21afd4
    
    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)
    
    preserver_image reversal, shift 0 e-b03bb7746bf562de
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Cube of lower triangular normalized binomial matrix.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-2786234a932620b2 (expanded above)
    
    parent_provers periodic_product e-58678fea8a24dd74 root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    basis_map A007318 e-7b97c40e19745577
    
    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 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 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 (expanded above)
    
    ↵ parent_provers periodic_product e-b7eca039219a7f53 (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-7e44b66e04c497d6 (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 (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 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)
    
    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 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 (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-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-4b09f87a5a93f62b
    
    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)
    
    parent_provers periodic_product e-bd3566bc3465f71b root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image mobius, shift 0 e-33c9dd76a325511a
    
    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)
    
    ↵ parent_provers periodic_product e-58678fea8a24dd74 (expanded above)
    
    ↵ basis_map A007318 e-7b97c40e19745577 (expanded above)
    
    ↵ preserver_image affine, shift 0 e-4b09f87a5a93f62b (expanded above)
    
    parent_provers periodic_product e-bf59fe80a0559f3e root: theorem check
    
    Parent-row provers of polytool polytool ?
    
    preserver_image affine, shift 0 e-4db64ce997502606
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Cube of lower triangular normalized binomial matrix.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    
    ↵ theorem_check liu_wang e-2786234a932620b2 (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-090c65763405a203 (expanded above)
    
    ↵ parent_provers periodic_product e-58678fea8a24dd74 (expanded above)
    
    ↵ basis_map A007318 e-7b97c40e19745577 (expanded above)
    
    ↵ preserver_image affine, shift 0 e-4b09f87a5a93f62b (expanded above)
    
    basis_map A013611 e-c19dc1e19e56bc04
    
    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)
    
    preserver_image mobius, shift 0 e-db5094ba61234dec
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle of coefficients in expansion of (1+3*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-035d18f235569c81 (expanded above)
    
    ↵ basis_map A013610 e-404109e50a21afd4 (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-b03bb7746bf562de (expanded above)
    
    ↵ parent_provers periodic_product e-bd3566bc3465f71b (expanded above)
    
    ↵ preserver_image mobius, shift 0 e-33c9dd76a325511a (expanded above)
    
    ↵ basis_map A007318 e-9f0b70d11cb8d495 (expanded above)
    
    ↵ parent_provers periodic_product e-bf59fe80a0559f3e (expanded above)
    
    ↵ preserver_image affine, shift 0 e-4db64ce997502606 (expanded above)
    
    preserver_image affine, shift 0 e-0ab1d5f59b4d29a0
    
    Affine, reversal and Möbius substitutions (elementary) polytool ?
    
    premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*4^(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-2d1c3ef96dc1c123 (expanded above)
    
    ↵ preserver_image reversal, shift 0 e-6e49a6f9dd41e218 (expanded above)
    
    ↵ basis_map A007318 e-9f0b70d11cb8d495 (expanded above)
    
    ↵ parent_provers periodic_product e-bf59fe80a0559f3e (expanded above)
    
    ↵ preserver_image affine, shift 0 e-4db64ce997502606 (expanded above)
    
    parent_provers periodic_product e-e44a3cf5ca807197 root: theorem check
    
    Parent-row provers of polytool polytool ?
  - parent_provers periodic_product e-a5624f2627681b92 root: theorem check
    
    Parent-row provers of polytool polytool ?
- premise (sequence): Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j.
  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.