A128099 → x ↦ x+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 3 | 2 | 5 | ||
| 3 | 5 | 4 | 9 | ||
| 4 | 11 | 14 | 4 | 29 | |
| 5 | 21 | 32 | 12 | 65 | |
| 6 | 43 | 82 | 48 | 8 | 181 |
| 7 | 85 | 188 | 136 | 32 | 441 |
Generated b-files: A006131 (row sums) ?
Computed in your browser ?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
Technical details
- Node id
n-0d89b6177f6a1dbb· revision 2 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-83b5abe075203202)- Fingerprint
f6-c33986a1af44d948
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 ?
- A006131: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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: 3, 2; 3: 5, 4; 4: 11, 14, 4; 5: 21, 32, 12; 6: 43, 82, 48, 8; 7: 85, 188, 136, 32; 8: 171, 438, 396, 144, 16; 9: 341, 984, 1044, 480, 80;
%F FormulaThe row polynomials satisfy n*P(n,x) = (5*n-4+(4*n-4)*x)*P(n-1,x) - (9+17*x+8*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 4 + (4*n - 4)*x)*P[n - 1, x] - (9 + 17*x + 8*x^2)*D[P[n - 1, x], x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((5*n - 4 + (4*n - 4)*x)*v[i - 1] - (9 + 17*x + 8*x^2)*deriv(v[i - 1], x))/(n)); 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, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-480e902e7a68d8c8 -
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-480e902e7a68d8c8,e-4aa3bf1829d77c70,e-c201453b6387188f -
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-480e902e7a68d8c8,e-4aa3bf1829d77c70,e-c201453b6387188f -
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-4aa3bf1829d77c70,e-c201453b6387188f -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-c201453b6387188f
Proof chains
4 incoming proof steps. 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-4aa3bf1829d77c70Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image affine, shift 0
e-61c0454a07890647Affine, 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…
-
preserver_image affine, shift 0
e-ddc26a351d976abeAffine, 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]
-
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-2a29a8b9938e2bd7Geometric basis map (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]
-
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-d0c14addeb793323Geometric basis map (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]
-
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…
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pie…
-
basis_map A007318
e-c201453b6387188fGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
gamma_polynomial scale 1, shift 0
e-250eeed7ad07d148Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Pascal-(1,2,1) array read by antidiagonals.
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-1f8dc4b132ba6116root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
preserver_image reversal, shift 0
e-8efc9aafb30c2198Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Pascal-(1,2,1) array read by antidiagonals.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Pascal-(1,2,1) array read by antidiagonals.
-
-
premise (sequence):
Pascal-(1,2,1) array read by antidiagonals.
-
preserver_image reversal, shift 0
e-6b9d711da9b2e815Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A027467
e-0db30c1d149f8e9aGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 15]
-
preserver_image affine, shift 0
e-0ffa0091fcab81abAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
theorem_check ma_wang_interval
e-2d5b16bf2955a407root: theorem checkMa–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?
-
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038303
e-1078e1fe9c978d23Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 10]
-
preserver_image affine, shift 0
e-ba5819a43d999a58Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038327
e-39068ae2f1d878f6Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 12]
-
preserver_image affine, shift 0
e-0ef3f7736abad08bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
preserver_image reversal, shift 0
e-5066005127b21217Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ gamma_polynomial scale 1, shift 0
e-250eeed7ad07d148(expanded above) -
parent_provers paper_theorem
e-7c3667820056c57croot: theorem checkParent-row provers of polytool polytool ?
-
↵ gamma_polynomial scale 1, shift 0
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
-
basis_map A027465
e-76bf35985f9d5eb4Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 3]
-
preserver_image affine, shift 0
e-5f9e6216c74dfca3Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038243
e-7b55c4767302dd2aGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 5]
-
preserver_image affine, shift 0
e-0c61b86c2e25257bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A007318
e-89ed187733702f47Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]
-
preserver_image affine, shift 0
e-38de1ebb8f2e73b6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038255
e-9c1dd42dfa910ea7Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 6]
-
preserver_image affine, shift 0
e-4867241b67312c9eAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038207
e-a0ae771232cbba16Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 2]
-
preserver_image affine, shift 0
e-c345fe1d5254381dAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038291
e-a2d6a4286b164d3dGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 9]
-
preserver_image affine, shift 0
e-f1a9ca5f4baaa1ddAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038231
e-b4c854eb781c5167Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 4]
-
preserver_image affine, shift 0
e-b26782bfa4993a06Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A038279
e-c41010d0d9363851Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 8]
-
preserver_image affine, shift 0
e-765910d978fe3ce9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A027466
e-de853701eca80777Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 7]
-
preserver_image affine, shift 0
e-2f0380ac472e9edcAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A Jacobsthal triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-8, 0]
-
premise (sequence):
A Jacobsthal triangle.
-
-
premise (sequence):
basis-map coefficients of A Jacobsthal triangle.
-
basis_map A113953
e-4e53ceff1d4735daAffine-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 ma_wang_interval
e-2d5b16bf2955a407(expanded above)
-
-
premise (sequence):
A Jacobsthal triangle.
-
↵ parent_provers paper_theorem
e-7c3667820056c57c(expanded above)
-
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
-
definition_equality
e-83b5abe075203202root: theorem checkOre-algebra identity of two definitions polytool ?
-
preserver_image affine, shift 0
e-480e902e7a68d8c8Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
References
- [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