A063967 → (θ+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 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 4 | 5 | ||||||
| 3 | 2 | 12 | 9 | 23 | |||||
| 4 | 3 | 28 | 45 | 16 | 92 | ||||
| 5 | 5 | 60 | 144 | 112 | 25 | 346 | |||
| 6 | 8 | 120 | 387 | 464 | 225 | 36 | 1240 | ||
| 7 | 13 | 232 | 936 | 1520 | 1150 | 396 | 49 | 4296 | |
| 8 | 21 | 436 | 2115 | 4336 | 4475 | 2412 | 637 | 64 | 14496 |
Computed in your browser ?
Technical details
- Node id
n-8d4eedf9d66a931a· revision 1 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-bd81fa9c8482d6ca
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: 1, 4; 3: 2, 12, 9; 4: 3, 28, 45, 16; 5: 5, 60, 144, 112, 25; 6: 8, 120, 387, 464, 225, 36; 7: 13, 232, 936, 1520, 1150, 396, 49; 8: 21, 436, 2115, 4336, 4475, 2412, 637, 64; 9: 34, 804, 4554, 11280, 14775, 10908, 4508, 960, 81; 10: 55, 1460, 9459, 27472, 43650, 41040, 23275, 7744, 1377, 100;
%F FormulaThe row polynomials satisfy (25+(75*n-85)*x+(60*n^2-110*n+34)*x^2+(15*n^3-25*n^2-18*n+26)*x^3+(n^4-13*n^2+14*n+1)*x^4-(n^3-n^2-n+1)*x^5)*P(n,x) = (25+(75*n+15)*x+(60*n^2+85*n-26)*x^2+(15*n^3+80*n^2-13*n-18)*x^3+(n^4+19*n^3+13*n^2-31*n+1)*x^4+(n^4+3*n^3-9*n^2-8*n+3)*x^5-(n^3+2*n^2)*x^6)*P(n-2,x) + (25+(75*n+15)*x+(60*n^2+50*n-26)*x^2+(15*n^3+65*n^2-68*n-18)*x^3+(n^4+17*n^3-6*n^2-48*n+1)*x^4+(n^4+n^3-12*n^2-5*n+3)*x^5-(n^3+n^2)*x^6)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 4*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((25 + (75*n + 15)*x + (60*n^2 + 85*n - 26)*x^2 + (15*n^3 + 80*n^2 - 13*n - 18)*x^3 + (n^4 + 19*n^3 + 13*n^2 - 31*n + 1)*x^4 + (n^4 + 3*n^3 - 9*n^2 - 8*n + 3)*x^5 - (n^3 + 2*n^2)*x^6)*P[n - 2, x] + (25 + (75*n + 15)*x + (60*n^2 + 50*n - 26)*x^2 + (15*n^3 + 65*n^2 - 68*n - 18)*x^3 + (n^4 + 17*n^3 - 6*n^2 - 48*n + 1)*x^4 + (n^4 + n^3 - 12*n^2 - 5*n + 3)*x^5 - (n^3 + n^2)*x^6)*P[n - 1, x])/(25 + (75*n - 85)*x + (60*n^2 - 110*n + 34)*x^2 + (15*n^3 - 25*n^2 - 18*n + 26)*x^3 + (n^4 - 13*n^2 + 14*n + 1)*x^4 - (n^3 - n^2 - n + 1)*x^5)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 4*x; for(n = 3, N, my(i = n); v[i] = ((25 + (75*n + 15)*x + (60*n^2 + 85*n - 26)*x^2 + (15*n^3 + 80*n^2 - 13*n - 18)*x^3 + (n^4 + 19*n^3 + 13*n^2 - 31*n + 1)*x^4 + (n^4 + 3*n^3 - 9*n^2 - 8*n + 3)*x^5 - (n^3 + 2*n^2)*x^6)*v[i - 2] + (25 + (75*n + 15)*x + (60*n^2 + 50*n - 26)*x^2 + (15*n^3 + 65*n^2 - 68*n - 18)*x^3 + (n^4 + 17*n^3 - 6*n^2 - 48*n + 1)*x^4 + (n^4 + n^3 - 12*n^2 - 5*n + 3)*x^5 - (n^3 + n^2)*x^6)*v[i - 1])/(25 + (75*n - 85)*x + (60*n^2 - 110*n + 34)*x^2 + (15*n^3 - 25*n^2 - 18*n + 26)*x^3 + (n^4 - 13*n^2 + 14*n + 1)*x^4 - (n^3 - n^2 - n + 1)*x^5)); 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-aa7e9b3181553556 -
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-aa7e9b3181553556 -
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-aa7e9b3181553556
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 euler_polynomial, shift 0
e-aa7e9b3181553556Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A063967
e-6e2f4b29fae24343Affine-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…
-
basis_map A027466
e-07199d0e633dc35bGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 7]
-
preserver_image affine, shift 0
e-12ad66072da87843Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
theorem_check ma_wang_interval
e-32a5b77539bbfdf5root: theorem checkMa–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038291
e-19f9843f81ec4d82Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 9]
-
preserver_image affine, shift 0
e-61f403043a781326Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038255
e-20a66a93533ac8e0Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 6]
-
preserver_image affine, shift 0
e-cc7a67409dceb768Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038279
e-2d6f22aa44a34472Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 8]
-
preserver_image affine, shift 0
e-f5bf3eab46ece5d6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A027465
e-300fe6b47fa78df1Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 3]
-
preserver_image affine, shift 0
e-acc0c42734fdb8fcAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038327
e-37edf5cceba94f47Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 12]
-
preserver_image affine, shift 0
e-4d81c1e2745a9ed0Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A007318
e-50014fa936b4943dGeometric basis map (elementary) polytool ?
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift -1
e-24564bef34b2c2e5Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers paper_theorem
e-0801036cdfff24d2root: theorem checkParent-row provers of polytool polytool ?
-
parent_provers paper_theorem
e-0d3631d0f359c9ceroot: theorem checkParent-row provers of polytool polytool ?
-
gamma_polynomial scale 1, shift 0
e-a039cba7823b0b25Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
delannoy
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-15c233e4385971d1root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-266d85ca03a298faAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
delannoy
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang_derivative_lag
e-15c233e4385971d1(expanded above) -
basis_map A008288
e-e771e35dc9ee3fbdAffine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
basis_map A008288
e-33dba7e79fe9caa8Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
↵ theorem_check liu_wang_derivative_lag
-
premise (sequence):
delannoy
-
↵ basis_map A008288
e-e771e35dc9ee3fbd(expanded above) -
↵ basis_map A008288
e-33dba7e79fe9caa8(expanded above)
-
-
premise (sequence):
delannoy
-
-
premise (sequence):
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…
-
basis_map A007318
e-fcd19baf8f835cf0Geometric basis map (elementary) polytool ?
-
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 (-inf, 1]
-
preserver_image affine, shift 0
e-1365676e8cb0fd13Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
preserver_image affine, shift 0
e-3c4e27dedb9c54a8Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0]
-
theorem_check ma_wang_interval
e-0178a3d1cd265fb6root: theorem checkMa–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?
-
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
-
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
basis_map A026729
e-fa68694d112454edAffine-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…
-
↵ theorem_check ma_wang_interval
e-0178a3d1cd265fb6(expanded above)
-
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
-
basis_map A038231
e-5c88965e8c99a752Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 4]
-
preserver_image affine, shift 0
e-0e7024e7b55599e9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038303
e-78cb35d9024a5ff1Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 10]
-
preserver_image affine, shift 0
e-25462190c1ff20a9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A007318
e-933c6ae38be5f965Geometric basis map (elementary) polytool ?
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
-
basis_map A038243
e-a054677672f9106dGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 5]
-
preserver_image affine, shift 0
e-81aeef92852c73bbAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
basis_map A038207
e-a7cf73c813009d2aGeometric basis map (elementary) polytool ?
-
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 (-inf, 2]
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
basis_map A027467
e-bfdacf28446aab8dGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 15]
-
preserver_image affine, shift 0
e-79b40901050ca651Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
-
↵ theorem_check ma_wang_interval
e-32a5b77539bbfdf5(expanded above) -
preserver_image affine, shift 0
e-e504746edac4d52eAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.
-
-
premise (sequence):
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
Related sequences ?
No candidate equalities or related sequences.
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.