A152198 → 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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 2 | 1 | 3 | ||||||
| 3 | 2 | 1 | 3 | ||||||
| 4 | 4 | 5 | 1 | 10 | |||||
| 5 | 4 | 5 | 1 | 10 | |||||
| 6 | 8 | 19 | 9 | 1 | 37 | ||||
| 7 | 8 | 19 | 9 | 1 | 37 | ||||
| 8 | 16 | 65 | 55 | 14 | 1 | 151 | |||
| 9 | 16 | 65 | 55 | 14 | 1 | 151 | |||
| 10 | 32 | 211 | 285 | 125 | 20 | 1 | 674 | ||
| 11 | 32 | 211 | 285 | 125 | 20 | 1 | 674 | ||
| 12 | 64 | 665 | 1351 | 910 | 245 | 27 | 1 | 3263 | |
| 13 | 64 | 665 | 1351 | 910 | 245 | 27 | 1 | 3263 | |
| 14 | 128 | 2059 | 6069 | 5901 | 2380 | 434 | 35 | 1 | 17007 |
Computed in your browser ?
Technical details
- Node id
n-1215aefd6b497450· revision 1 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-82c833119bb95b4e
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 1; 2: 2, 1; 3: 2, 1; 4: 4, 5, 1; 5: 4, 5, 1; 6: 8, 19, 9, 1; 7: 8, 19, 9, 1; 8: 16, 65, 55, 14, 1; 9: 16, 65, 55, 14, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (2+x)*P(n-2,x) + x*d/dx P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 2, x] + x*D[P[n - 2, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (2 + x)*v[i - 2] + x*deriv(v[i - 2], x)); 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-605197fddea5dbfb -
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-605197fddea5dbfb -
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-605197fddea5dbfb
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-605197fddea5dbfbRay basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
Triangle read by rows, A007318 rows repeated.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-3ca43d0d97d5e532Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: triangle of repeated stepped binomial coefficients.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-35a33ce2a6b89415root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows: triangle of repeated stepped binomial coefficients.
-
gamma_polynomial scale 1, shift 0
e-78c582ff5f7b6a70Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-6e3ca670df3d0a74root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-b2e3690a28625635Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
-
-
premise (sequence):
Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …
-
parent_provers periodic_product
e-b274e5cc6dbb8c2droot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, A007318 rows repeated.
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
References
- [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