A133087 → x ↦ x/(x+1)
nonnegative coefficients only rational roots
Proved for all n: all roots real, in [−1, 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) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 3 | 5 | |||||||||||||
| 2 | 1 | 4 | 4 | 9 | ||||||||||||
| 3 | 2 | 11 | 20 | 12 | 45 | |||||||||||
| 4 | 1 | 8 | 24 | 32 | 16 | 81 | ||||||||||
| 5 | 2 | 19 | 72 | 136 | 128 | 48 | 405 | |||||||||
| 6 | 1 | 12 | 60 | 160 | 240 | 192 | 64 | 729 | ||||||||
| 7 | 2 | 27 | 156 | 500 | 960 | 1104 | 704 | 192 | 3645 | |||||||
| 8 | 1 | 16 | 112 | 448 | 1120 | 1792 | 1792 | 1024 | 256 | 6561 | ||||||
| 9 | 2 | 35 | 272 | 1232 | 3584 | 6944 | 8960 | 7424 | 3584 | 768 | 32805 | |||||
| 10 | 1 | 20 | 180 | 960 | 3360 | 8064 | 13440 | 15360 | 11520 | 5120 | 1024 | 59049 | ||||
| 11 | 2 | 43 | 420 | 2460 | 9600 | 26208 | 51072 | 71040 | 69120 | 44800 | 17408 | 3072 | 295245 | |||
| 12 | 1 | 24 | 264 | 1760 | 7920 | 25344 | 59136 | 101376 | 126720 | 112640 | 67584 | 24576 | 4096 | 531441 | ||
| 13 | 2 | 51 | 600 | 4312 | 21120 | 74448 | 194304 | 380160 | 557568 | 605440 | 473088 | 251904 | 81920 | 12288 | 2657205 | |
| 14 | 1 | 28 | 364 | 2912 | 16016 | 64064 | 192192 | 439296 | 768768 | 1025024 | 1025024 | 745472 | 372736 | 114688 | 16384 | 4782969 |
Computed in your browser ?
Technical details
- Node id
n-731fd6af3e9cacc2· revision 1 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-0fc72d33f55fbdc4
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 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 ℚ): yes
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: 2, 3; 2: 1, 4, 4; 3: 2, 11, 20, 12; 4: 1, 8, 24, 32, 16; 5: 2, 19, 72, 136, 128, 48; 6: 1, 12, 60, 160, 240, 192, 64; 7: 2, 27, 156, 500, 960, 1104, 704, 192; 8: 1, 16, 112, 448, 1120, 1792, 1792, 1024, 256; 9: 2, 35, 272, 1232, 3584, 6944, 8960, 7424, 3584, 768;
%F FormulaThe row polynomials satisfy (1+2*x+x^2)*P(n,x) = -(6*n-8+(28*n-35)*x+(48*n-56)*x^2+(36*n-39)*x^3+(10*n-10)*x^4)*P(n-1,x) + (3+20*x+52*x^2+66*x^3+41*x^4+10*x^5)*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[(-(6*n - 8 + (28*n - 35)*x + (48*n - 56)*x^2 + (36*n - 39)*x^3 + (10*n - 10)*x^4)*P[n - 1, x] + (3 + 20*x + 52*x^2 + 66*x^3 + 41*x^4 + 10*x^5)*D[P[n - 1, x], x])/(1 + 2*x + x^2)]];
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] = (-(6*n - 8 + (28*n - 35)*x + (48*n - 56)*x^2 + (36*n - 39)*x^3 + (10*n - 10)*x^4)*v[i - 1] + (3 + 20*x + 52*x^2 + 66*x^3 + 41*x^4 + 10*x^5)*deriv(v[i - 1], x))/(1 + 2*x + x^2)); 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 [-1, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-c6d5cef6173ca46f -
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-c6d5cef6173ca46f -
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-c6d5cef6173ca46f
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 mobius, shift 0
e-c6d5cef6173ca46fAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A133080 * A007318.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A007318
e-3537980ff71b1a89Geometric basis map (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-4d02ac33f5b2fbc9root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
parent_provers periodic_product
e-aa3a6b002de14e0croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-28a1cf3333f63fa4Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
-
premise (sequence):
A133080 * A007318.
Related sequences ?
No candidate equalities or related sequences.