A225471 → basis A013611 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(4 + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 4 | 8 | ||||||
| 2 | 16 | 48 | 32 | 96 | |||||
| 3 | 64 | 384 | 704 | 384 | 1536 | ||||
| 4 | 256 | 2560 | 8960 | 12800 | 6144 | 30720 | |||
| 5 | 1024 | 15360 | 87040 | 230400 | 280576 | 122880 | 737280 | ||
| 6 | 4096 | 86016 | 716800 | 3010560 | 6651904 | 7225344 | 2949120 | 20643840 | |
| 7 | 16384 | 458752 | 5275648 | 32112640 | 110903296 | 215154688 | 214106112 | 82575360 | 660602880 |
Compute more
?
Technical details
- Node id
n-14c2f5429534f895· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-34eaf45657600f7a
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 4; 2: 16, 48, 32; 3: 64, 384, 704, 384; 4: 256, 2560, 8960, 12800, 6144; 5: 1024, 15360, 87040, 230400, 280576, 122880; 6: 4096, 86016, 716800, 3010560, 6651904, 7225344, 2949120; 7: 16384, 458752, 5275648, 32112640, 110903296, 215154688, 214106112, 82575360; 8: 65536, 2359296, 35782656, 297271296, 1471217664, 4409524224, 7741374464, 7181697024, 2642411520; 9: 262144, 11796480, 228065280, 2477260800, 16586637312, 70601932800, 189708369920, 307416268800, 269110738944, 95126814720;
%F FormulaThe row polynomials satisfy P(n,x) = (4+4*n*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4 + 4*n*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4 + 4*n*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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
Related ?
Same fingerprint ?
- A130534: Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded…
- A225470 → basis A013610 → reverse
- A204420 → basis A007318 → basis A013609
- A180013: Triangular array read by rows: T(n,k) = number of fixed points in the permutations of {1,2,...,n} that have ex…
- A028338 → basis A013609
- A225470 → basis A013610
- A132393 → reverse
- A216118: Triangle read by rows: T(n,k) is the number of stretching pairs in all permutations in S_{n,k} (=set of permut…
- A028338 → basis A013609 → reverse
- A132393: Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
- A094638: Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A…
- A225471 → basis A013611
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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.