A011973 → basis A007318 → Veronese 2 (j=1)
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 0 | ||||
| 1 | 0 | ||||
| 2 | 1 | 1 | |||
| 3 | 2 | 2 | |||
| 4 | 5 | 5 | |||
| 5 | 10 | 10 | |||
| 6 | 20 | 1 | 21 | ||
| 7 | 38 | 4 | 42 | ||
| 8 | 71 | 14 | 85 | ||
| 9 | 130 | 40 | 170 | ||
| 10 | 235 | 105 | 1 | 341 | |
| 11 | 420 | 256 | 6 | 682 | |
| 12 | 744 | 594 | 27 | 1365 | |
| 13 | 1308 | 1324 | 98 | 2730 | |
| 14 | 2285 | 2860 | 315 | 1 | 5461 |
Generated b-files: A000975 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-ef372d4e81b6a9dd· revision 1 · JSON- Definition source
derived:veronese_section_2_1- Fingerprint
f5-9b003b29096317f1
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3 (irregular)
- 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 ?
- A280148: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A000975: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
- A279751: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
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 ExampleTriangle begins: 0: 0; 1: 0; 2: 1; 3: 2; 4: 5; 5: 10; 6: 20, 1; 7: 38, 4; 8: 71, 14; 9: 130, 40;
%F FormulaThe row polynomials satisfy P(n,x) = 2*P(n-1,x) + P(n-2,x) - 2*P(n-3,x) - (1-x)*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1, P(3,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 1;
P[3, x_] := 2;
P[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] + P[n - 2, x] - 2*P[n - 3, x] - (1 - x)*P[n - 4, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; v[4] = 2; for(n = 4, N, my(i = n + 1); v[i] = 2*v[i - 1] + v[i - 2] - 2*v[i - 3] - (1 - x)*v[i - 4]); 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-44260c957624f4a5 -
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-44260c957624f4a5 -
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-44260c957624f4a5
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-44260c957624f4a5Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image affine, shift 0
e-61c0454a07890647Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers paper_theorem
e-0801036cdfff24d2root: theorem checkParent-row provers of polytool polytool ?
-
parent_provers paper_theorem
e-0d3631d0f359c9ceroot: theorem checkParent-row provers of polytool polytool ?
-
gamma_polynomial scale 1, shift 0
e-a039cba7823b0b25Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
delannoy
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-15c233e4385971d1root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-266d85ca03a298faAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
delannoy
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang_derivative_lag
e-15c233e4385971d1(expanded above) -
basis_map A008288
e-e771e35dc9ee3fbdAffine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
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 [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
basis_map A008288
e-33dba7e79fe9caa8Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
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 [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
↵ theorem_check liu_wang_derivative_lag
-
premise (sequence):
delannoy
-
↵ basis_map A008288
e-e771e35dc9ee3fbd(expanded above) -
↵ basis_map A008288
e-33dba7e79fe9caa8(expanded above)
-
-
premise (sequence):
delannoy
-
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
preserver_image affine, shift 0
e-ddc26a351d976abeAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
basis_map A007318
e-2a29a8b9938e2bd7Geometric basis map (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
basis_map A007318
e-d0c14addeb793323Geometric basis map (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…
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