A102547 → reverse → basis A013609
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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 2 | 3 | |||||||
| 1 | 1 | 4 | 4 | 9 | ||||||
| 2 | 1 | 6 | 12 | 8 | 27 | |||||
| 3 | 2 | 14 | 36 | 40 | 16 | 108 | ||||
| 4 | 3 | 26 | 88 | 144 | 112 | 32 | 405 | |||
| 5 | 4 | 42 | 180 | 400 | 480 | 288 | 64 | 1458 | ||
| 6 | 6 | 72 | 364 | 1000 | 1600 | 1472 | 704 | 128 | 5346 | |
| 7 | 9 | 122 | 712 | 2328 | 4640 | 5728 | 4224 | 1664 | 256 | 19683 |
Computed in your browser ?
Technical details
- Node id
n-da6d41f828bec089· revision 1 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-0285751edb6686c9
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 ℚ): 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, 2; 1: 1, 4, 4; 2: 1, 6, 12, 8; 3: 2, 14, 36, 40, 16; 4: 3, 26, 88, 144, 112, 32; 5: 4, 42, 180, 400, 480, 288, 64; 6: 6, 72, 364, 1000, 1600, 1472, 704, 128; 7: 9, 122, 712, 2328, 4640, 5728, 4224, 1664, 256; 8: 13, 198, 1320, 5040, 12096, 18816, 18816, 11520, 3840, 512; 9: 19, 320, 2392, 10424, 29232, 54880, 69440, 57984, 30208, 8704, 1024;
%F FormulaThe row polynomials satisfy P(n,x) = (1+4*x+4*x^2)*P(n-3,x) + (1+2*x)*P(n-1,x) for n >= 3, with P(0,x) = 1 + 2*x, P(1,x) = 1 + 4*x + 4*x^2, P(2,x) = 1 + 6*x + 12*x^2 + 8*x^3.
%t MathematicaP[0, x_] := 1 + 2*x;
P[1, x_] := 1 + 4*x + 4*x^2;
P[2, x_] := 1 + 6*x + 12*x^2 + 8*x^3;
P[n_, x_] := P[n, x] = Expand[(1 + 4*x + 4*x^2)*P[n - 3, x] + (1 + 2*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1 + 2*x; v[2] = 1 + 4*x + 4*x^2; v[3] = 1 + 6*x + 12*x^2 + 8*x^3; for(n = 3, N, my(i = n + 1); v[i] = (1 + 4*x + 4*x^2)*v[i - 3] + (1 + 2*x)*v[i - 1]); 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-9d8ee33f10e795ac -
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-9d8ee33f10e795ac -
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-9d8ee33f10e795ac
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 A013609
e-9d8ee33f10e795acGeometric basis map (elementary) polytool ?
-
premise (sequence):
Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-0e9e334768ea0a35Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, formed from antidiagonals of the antidiagonals (A011973) of Pascal's triangle (A007318).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-9cfbf7a52f4ba322Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]no recorded property covers this requirement
-
premise (sequence):
Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..…
-
parent_provers paper_theorem
e-eef18680cd27a7c9root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, formed from antidiagonals of the antidiagonals (A011973) of Pascal's triangle (A007318).
-
-
premise (sequence):
Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..…
Related sequences ?
No candidate equalities or related sequences.