A064861 → D
nonnegative coefficients only rational roots
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 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | x15 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 4 | 7 | ||||||||||||||
| 1 | 5 | 16 | 12 | 33 | |||||||||||||
| 2 | 6 | 26 | 36 | 16 | 84 | ||||||||||||
| 3 | 8 | 50 | 114 | 112 | 40 | 324 | |||||||||||
| 4 | 9 | 66 | 189 | 264 | 180 | 48 | 756 | ||||||||||
| 5 | 11 | 102 | 387 | 768 | 840 | 480 | 112 | 2700 | |||||||||
| 6 | 12 | 124 | 540 | 1284 | 1800 | 1488 | 672 | 128 | 6048 | ||||||||
| 7 | 14 | 172 | 912 | 2724 | 5010 | 5808 | 4144 | 1664 | 288 | 20736 | |||||||
| 8 | 15 | 200 | 1170 | 3940 | 8415 | 11820 | 10920 | 6400 | 2160 | 320 | 45360 | ||||||
| 9 | 17 | 260 | 1770 | 7060 | 18265 | 32016 | 38500 | 31360 | 16560 | 5120 | 704 | 151632 | |||||
| 10 | 18 | 294 | 2160 | 9420 | 27090 | 53934 | 75852 | 75360 | 51840 | 23520 | 6336 | 768 | 326592 | ||||
| 11 | 20 | 366 | 3042 | 15180 | 50640 | 118950 | 201698 | 248736 | 221400 | 138720 | 58080 | 14592 | 1664 | 1073088 | |||
| 12 | 21 | 406 | 3591 | 19236 | 69615 | 179718 | 340473 | 479248 | 501228 | 384720 | 210672 | 77952 | 17472 | 1792 | 2286144 | ||
| 13 | 23 | 490 | 4809 | 28812 | 117705 | 346794 | 759815 | 1257472 | 1579536 | 1498560 | 1057056 | 537600 | 186368 | 39424 | 3840 | 7418304 | |
| 14 | 24 | 536 | 5544 | 35224 | 153720 | 488040 | 1164408 | 2125832 | 2994192 | 3253600 | 2705472 | 1690752 | 768768 | 240128 | 46080 | 4096 | 15676416 |
Computed in your browser ?
Technical details
- Node id
n-2ff13446e75f9dd4· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-1788d34a8315ad53
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 ?
No OEIS matches.
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: 3, 4; 1: 5, 16, 12; 2: 6, 26, 36, 16; 3: 8, 50, 114, 112, 40; 4: 9, 66, 189, 264, 180, 48; 5: 11, 102, 387, 768, 840, 480, 112; 6: 12, 124, 540, 1284, 1800, 1488, 672, 128; 7: 14, 172, 912, 2724, 5010, 5808, 4144, 1664, 288; 8: 15, 200, 1170, 3940, 8415, 11820, 10920, 6400, 2160, 320; 9: 17, 260, 1770, 7060, 18265, 32016, 38500, 31360, 16560, 5120, 704;
%F FormulaThe row polynomials satisfy (9*n^2+13*n+4+(24*n^2+28*n+4)*x+(16*n^2+16*n)*x^2)*P(n,x) = (27*n^2+53*n+6+(27*n^3+204*n^2+283*n+14)*x+(108*n^3+512*n^2+548*n+8)*x^2+(144*n^3+528*n^2+448*n)*x^3+(64*n^3+192*n^2+128*n)*x^4)*P(n-1,x) - (12*n+20+(18*n^2+130*n+160)*x+(102*n^2+482*n+484)*x^2+(212*n^2+812*n+696)*x^3+(192*n^2+640*n+480)*x^4+(64*n^2+192*n+128)*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((27*n^2 + 53*n + 6 + (27*n^3 + 204*n^2 + 283*n + 14)*x + (108*n^3 + 512*n^2 + 548*n + 8)*x^2 + (144*n^3 + 528*n^2 + 448*n)*x^3 + (64*n^3 + 192*n^2 + 128*n)*x^4)*P[n - 1, x] - (12*n + 20 + (18*n^2 + 130*n + 160)*x + (102*n^2 + 482*n + 484)*x^2 + (212*n^2 + 812*n + 696)*x^3 + (192*n^2 + 640*n + 480)*x^4 + (64*n^2 + 192*n + 128)*x^5)*D[P[n - 1, x], x])/(9*n^2 + 13*n + 4 + (24*n^2 + 28*n + 4)*x + (16*n^2 + 16*n)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 3 + 4*x; for(n = 1, N, my(i = n + 1); v[i] = ((27*n^2 + 53*n + 6 + (27*n^3 + 204*n^2 + 283*n + 14)*x + (108*n^3 + 512*n^2 + 548*n + 8)*x^2 + (144*n^3 + 528*n^2 + 448*n)*x^3 + (64*n^3 + 192*n^2 + 128*n)*x^4)*v[i - 1] - (12*n + 20 + (18*n^2 + 130*n + 160)*x + (102*n^2 + 482*n + 484)*x^2 + (212*n^2 + 812*n + 696)*x^3 + (192*n^2 + 640*n + 480)*x^4 + (64*n^2 + 192*n + 128)*x^5)*deriv(v[i - 1], x))/(9*n^2 + 13*n + 4 + (24*n^2 + 28*n + 4)*x + (16*n^2 + 16*n)*x^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-4ace2775516c13f5 -
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-4ace2775516c13f5 -
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-4ace2775516c13f5
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
-
preserver_image derivative_polynomial, shift 0
e-4ace2775516c13f5Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-bbffc3f85cdc52e2root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.
Related sequences ?
No candidate equalities or related sequences.
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.