A159854 → x ↦ x+1 → basis A013609
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(3 + 2\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 4 + 8\,x + 4\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 4 | 8 | 4 | 16 | |||||||
| 1 | 12 | 32 | 28 | 8 | 80 | ||||||
| 2 | 36 | 120 | 148 | 80 | 16 | 400 | |||||
| 3 | 108 | 432 | 684 | 536 | 208 | 32 | 2000 | ||||
| 4 | 324 | 1512 | 2916 | 2976 | 1696 | 512 | 64 | 10000 | |||
| 5 | 972 | 5184 | 11772 | 14760 | 11040 | 4928 | 1216 | 128 | 50000 | ||
| 6 | 2916 | 17496 | 45684 | 67824 | 62640 | 36864 | 13504 | 2816 | 256 | 250000 | |
| 7 | 8748 | 58320 | 172044 | 294840 | 323568 | 235872 | 114240 | 35456 | 6400 | 512 | 1250000 |
Compute more
?
Technical details
- Node id
n-d5d42290d69eb05d· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-f26e13ac80424634
Observed on the stored rows ?
- Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
- 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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 4, 8, 4; 1: 12, 32, 28, 8; 2: 36, 120, 148, 80, 16; 3: 108, 432, 684, 536, 208, 32; 4: 324, 1512, 2916, 2976, 1696, 512, 64; 5: 972, 5184, 11772, 14760, 11040, 4928, 1216, 128; 6: 2916, 17496, 45684, 67824, 62640, 36864, 13504, 2816, 256; 7: 8748, 58320, 172044, 294840, 323568, 235872, 114240, 35456, 6400, 512; 8: 26244, 192456, 632772, 1228608, 1560384, 1354752, 814464, 334848, 90112, 14336, 1024; 9: 78732, 629856, 2283228, 4951368, 7138368, 7185024, 5152896, 2633472, 940032, 223232, 31744, 2048;
%F FormulaThe row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) for n >= 1, with P(0,x) = 4 + 8*x + 4*x^2.
%t MathematicaP[0, x_] := 4 + 8*x + 4*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + 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] = 4 + 8*x + 4*x^2; for(n = 1, N, my(i = n + 1); v[i] = (3 + 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
shift_x_plus_one of Riordan array (1-x,x/(1-x)).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Riordan array (1-x,x/(1-x)).?
-
-
from
shift_x_plus_one of Riordan array (1-x,x/(1-x)).?
Related ?
Same fingerprint ?
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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.