basis-map coefficients of A026729 → basis A056242 → 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 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | 2 | 2 | ||||||
| 3 | 5 | 5 | ||||||
| 4 | 9 | 8 | 17 | |||||
| 5 | 14 | 44 | 58 | |||||
| 6 | 20 | 146 | 32 | 198 | ||||
| 7 | 27 | 377 | 272 | 676 | ||||
| 8 | 35 | 833 | 1312 | 128 | 2308 | |||
| 9 | 44 | 1652 | 4712 | 1472 | 7880 | |||
| 10 | 54 | 3024 | 14002 | 9312 | 512 | 26904 | ||
| 11 | 65 | 5202 | 36365 | 42800 | 7424 | 91856 | ||
| 12 | 77 | 8514 | 85305 | 159560 | 58112 | 2048 | 313616 | |
| 13 | 90 | 13376 | 184690 | 511380 | 325376 | 35840 | 1070752 | |
| 14 | 104 | 20306 | 374660 | 1459810 | 1458368 | 334336 | 8192 | 3655776 |
| 15 | 119 | 29939 | 720005 | 3800305 | 5556320 | 2206976 | 167936 | 12481600 |
Generated b-files: A010914 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-9b386d37c9b7149f· revision 1 · JSON- Definition source
derived:veronese_section_2_1- Fingerprint
f6-0d65fc86478ed3bb
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 -2)
- 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 ?
- A010914: row sums, 13 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.
The atlas's own rows: n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 0; 2: 2; 3: 5; 4: 9, 8; 5: 14, 44; 6: 20, 146, 32; 7: 27, 377, 272; 8: 35, 833, 1312, 128; 9: 44, 1652, 4712, 1472; 10: 54, 3024, 14002, 9312, 512;
%F FormulaThe row polynomials satisfy P(n,x) = 4*P(n-1,x) - (6-4*x)*P(n-2,x) + (4-4*x)*P(n-3,x) - (1-x)*P(n-4,x) for n >= 5, with P(1,x) = 0, P(2,x) = 2, P(3,x) = 5, P(4,x) = 9 + 8*x.
%t MathematicaP[1, x_] := 0;
P[2, x_] := 2;
P[3, x_] := 5;
P[4, x_] := 9 + 8*x;
P[n_, x_] := P[n, x] = Expand[4*P[n - 1, x] - (6 - 4*x)*P[n - 2, x] + (4 - 4*x)*P[n - 3, x] - (1 - x)*P[n - 4, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; v[3] = 5; v[4] = 9 + 8*x; for(n = 5, N, my(i = n); v[i] = 4*v[i - 1] - (6 - 4*x)*v[i - 2] + (4 - 4*x)*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, v[i])))};
T(10)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 1, 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-27376e0c0e2dfb80 -
Coefficients of one sign. Every nonzero row, n >= 1: 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-27376e0c0e2dfb80 -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-27376e0c0e2dfb80
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-27376e0c0e2dfb80Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A056242
e-3cb5f3d64c4bb317Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in [0, 0]no recorded property covers this requirement
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
-
premise (sequence):
Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
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