basis-map coefficients of A113214, shifted → (θ+1)²
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 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | -1 | -4 | -5 | |||||||||||||
| 2 | 1 | 8 | 9 | 18 | ||||||||||||
| 3 | -1 | -12 | -27 | -16 | -56 | |||||||||||
| 4 | 1 | 16 | 54 | 64 | 25 | 160 | ||||||||||
| 5 | -1 | -20 | -90 | -160 | -125 | -36 | -432 | |||||||||
| 6 | 1 | 24 | 135 | 320 | 375 | 216 | 49 | 1120 | ||||||||
| 7 | -1 | -28 | -189 | -560 | -875 | -756 | -343 | -64 | -2816 | |||||||
| 8 | 1 | 32 | 252 | 896 | 1750 | 2016 | 1372 | 512 | 81 | 6912 | ||||||
| 9 | -1 | -36 | -324 | -1344 | -3150 | -4536 | -4116 | -2304 | -729 | -100 | -16640 | |||||
| 10 | 1 | 40 | 405 | 1920 | 5250 | 9072 | 10290 | 7680 | 3645 | 1000 | 121 | 39424 | ||||
| 11 | -1 | -44 | -495 | -2640 | -8250 | -16632 | -22638 | -21120 | -13365 | -5500 | -1331 | -144 | -92160 | |||
| 12 | 1 | 48 | 594 | 3520 | 12375 | 28512 | 45276 | 50688 | 40095 | 22000 | 7986 | 1728 | 169 | 212992 | ||
| 13 | -1 | -52 | -702 | -4576 | -17875 | -46332 | -84084 | -109824 | -104247 | -71500 | -34606 | -11232 | -2197 | -196 | -487424 | |
| 14 | 1 | 56 | 819 | 5824 | 25025 | 72072 | 147147 | 219648 | 243243 | 200200 | 121121 | 52416 | 15379 | 2744 | 225 | 1105920 |
Computed in your browser ?
Technical details
- Node id
n-d86e5cb7bac98d17· revision 1 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-d42e6339eab21b9c
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): no - 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, -4; 2: 1, 8, 9; 3: -1, -12, -27, -16; 4: 1, 16, 54, 64, 25; 5: -1, -20, -90, -160, -125, -36; 6: 1, 24, 135, 320, 375, 216, 49; 7: -1, -28, -189, -560, -875, -756, -343, -64; 8: 1, 32, 252, 896, 1750, 2016, 1372, 512, 81; 9: -1, -36, -324, -1344, -3150, -4536, -4116, -2304, -729, -100;
%F FormulaThe row polynomials satisfy (1+(3*n-1)*x+n^2*x^2)*P(n,x) = -(1+(3*n+3)*x+(n^2+5*n+3)*x^2+(n^2+2*n+1)*x^3)*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[(-(1 + (3*n + 3)*x + (n^2 + 5*n + 3)*x^2 + (n^2 + 2*n + 1)*x^3)*P[n - 1, x])/(1 + (3*n - 1)*x + n^2*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] = (-(1 + (3*n + 3)*x + (n^2 + 5*n + 3)*x^2 + (n^2 + 2*n + 1)*x^3)*v[i - 1])/(1 + (3*n - 1)*x + n^2*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 (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-0045543824a8afca -
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-0045543824a8afca -
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-0045543824a8afca
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-0045543824a8afcaLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-60aa79917842b999Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A007318
e-c62e3171974f4f9cGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-5a4f04ff49b735c1root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-4adca88d3fcf673eAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
parent_provers periodic_product
e-c76ca1e6cd597d3broot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-c58069640929a62bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
-
↵ basis_map A007318
e-c62e3171974f4f9c(expanded above) -
↵ parent_provers periodic_product
e-c76ca1e6cd597d3b(expanded above) -
↵ preserver_image affine, shift 0
e-c58069640929a62b(expanded above)
-
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
Related sequences ?
Same fingerprint (12)
Equal up to content, sign, reversal and a small index shift.
- A085880 → (θ+1)²
- A135838 → (θ+1)²
- A178821 → (θ+1)²
- A178822 → (θ+1)²
- A178820 → (θ+1)²
- A038208 → (θ+1)²
- A344565 → (θ+1)²
- A007318 → ×(1+2n+n²) → (θ+1)²
- A007318 → (θ+1)² → reverse
- A007318 → D → (θ+1)²
- A028326 → (θ+1)²
- A125092: Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.