A086645 → basis A008277
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 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 2 | 1 | 3 | |||||||||||||
| 3 | 8 | 9 | 1 | 18 | ||||||||||||
| 4 | 32 | 67 | 21 | 1 | 121 | |||||||||||
| 5 | 128 | 449 | 263 | 38 | 1 | 879 | ||||||||||
| 6 | 512 | 2851 | 2685 | 725 | 60 | 1 | 6834 | |||||||||
| 7 | 2048 | 17553 | 24655 | 10514 | 1625 | 87 | 1 | 56483 | ||||||||
| 8 | 8192 | 106051 | 212541 | 131649 | 31808 | 3178 | 119 | 1 | 493539 | |||||||
| 9 | 32768 | 633089 | 1759103 | 1506118 | 520741 | 80794 | 5642 | 156 | 1 | 4538412 | ||||||
| 10 | 131072 | 3749827 | 14162493 | 16225789 | 7618116 | 1675227 | 180810 | 9318 | 198 | 1 | 43752851 | |||||
| 11 | 524288 | 22095249 | 111831151 | 167599210 | 103235185 | 30476773 | 4630827 | 367560 | 14550 | 245 | 1 | 440775039 | ||||
| 12 | 2097152 | 129739171 | 870809181 | 1679060009 | 1324387768 | 506475684 | 102492005 | 11395395 | 692868 | 21725 | 297 | 1 | 4627171256 | |||
| 13 | 8388608 | 760009793 | 6711817151 | 16442574558 | 16313984653 | 7880799912 | 2047633988 | 301413156 | 25572723 | 1228931 | 31273 | 354 | 1 | 50493455101 | ||
| 14 | 33554432 | 4444999651 | 51340005405 | 158254054725 | 194838531420 | 116698726053 | 37938411160 | 7123458680 | 796514290 | 53248052 | 2073071 | 43667 | 416 | 1 | 571523621023 | |
| 15 | 134217728 | 25968708369 | 390474355951 | 1502918291490 | 2271736892985 | 1663170793347 | 663694423413 | 154829792160 | 21971717560 | 1928792866 | 104200096 | 3352986 | 59423 | 483 | 1 | 6696935598858 |
Computed in your browser ?
Technical details
- Node id
n-906addf72943ef6d· revision 1 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-91622946028ad904
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (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 ℚ): no
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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 1; 3: 8, 9, 1; 4: 32, 67, 21, 1; 5: 128, 449, 263, 38, 1; 6: 512, 2851, 2685, 725, 60, 1; 7: 2048, 17553, 24655, 10514, 1625, 87, 1; 8: 8192, 106051, 212541, 131649, 31808, 3178, 119, 1; 9: 32768, 633089, 1759103, 1506118, 520741, 80794, 5642, 156, 1; 10: 131072, 3749827, 14162493, 16225789, 7618116, 1675227, 180810, 9318, 198, 1;
%F FormulaThe row polynomials satisfy P(n,x) = -(x+x^2)*P(n-2,x) - (x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (4+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[-(x + x^2)*P[n - 2, x] - (x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (4 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + x; for(n = 3, N, my(i = n); v[i] = -(x + x^2)*v[i - 2] - (x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (4 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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-7a99d256bfb82b46 -
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-7a99d256bfb82b46 -
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-7a99d256bfb82b46
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
-
basis_map A008277
e-7a99d256bfb82b46Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
Triangle read by rows: T(n, k) = binomial(2n, 2k).
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-1375f2f1a11f9809root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
preserver_image reversal, shift 0
e-a5e3cd5a8b6d6a1aAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n, k) = binomial(2n, 2k).
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle read by rows: T(n, k) = binomial(2n, 2k).
-
-
premise (sequence):
Triangle read by rows: T(n, k) = binomial(2n, 2k).
Related sequences ?
No candidate equalities or related sequences.
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023