A225470 → basis A013609 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2 + 3\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
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 | 4 | 18 | 18 | 40 | ||||||||||||
| 3 | 8 | 72 | 198 | 162 | 440 | |||||||||||
| 4 | 16 | 240 | 1260 | 2700 | 1944 | 6160 | ||||||||||
| 5 | 32 | 720 | 6120 | 24300 | 44388 | 29160 | 104720 | |||||||||
| 6 | 64 | 2016 | 25200 | 158760 | 526176 | 857304 | 524880 | 2094400 | ||||||||
| 7 | 128 | 5376 | 92736 | 846720 | 4386312 | 12764304 | 19053144 | 11022480 | 48171200 | |||||||
| 8 | 256 | 13824 | 314496 | 3919104 | 29093904 | 130800096 | 344449584 | 479320416 | 264539520 | 1252451200 | ||||||
| 9 | 512 | 34560 | 1002240 | 16329600 | 164003616 | 1047135600 | 4220501760 | 10258779600 | 13470730272 | 7142567040 | 36321084800 | |||||
| 10 | 1024 | 84480 | 3041280 | 62726400 | 817895232 | 7014379680 | 39855071520 | 147132612000 | 334704848544 | 418407042240 | 214277011200 | 1162274713600 | ||||
| 11 | 2048 | 202752 | 8870400 | 225815040 | 3705761664 | 41019302016 | 311184672480 | 1609482584160 | 5524785893088 | 11882074086432 | 14235986416320 | 7071141369600 | 40679614976000 | |||
| 12 | 4096 | 479232 | 25039872 | 770964480 | 15540864768 | 215446023936 | 2099064217536 | 14421613377600 | 68990944815936 | 222656440324032 | 456226639944192 | 526637793726720 | 254561089305600 | 1545825369088000 | ||
| 13 | 8192 | 1118208 | 68769792 | 2518483968 | 61149344256 | 1036985773824 | 12600523368576 | 110706731239104 | 700424811358272 | 3135959728469568 | 9596054452525632 | 18846114545276928 | 21047996133953280 | 9927882482918400 | 63378840132608000 | |
| 14 | 16384 | 2580480 | 184504320 | 7925299200 | 228075015168 | 4642244006400 | 68754449237760 | 750635443958400 | 6050532334758912 | 35689761533986560 | 150902417500773120 | 440726516096630400 | 833632803169537536 | 903871602591874560 | 416971064282572800 | 2788668965834752000 |
Compute more
?
Technical details
- Node id
n-32d1e8cbf149a672· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-9e437d53009ce099
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: 2, 3; 2: 4, 18, 18; 3: 8, 72, 198, 162; 4: 16, 240, 1260, 2700, 1944; 5: 32, 720, 6120, 24300, 44388, 29160; 6: 64, 2016, 25200, 158760, 526176, 857304, 524880; 7: 128, 5376, 92736, 846720, 4386312, 12764304, 19053144, 11022480; 8: 256, 13824, 314496, 3919104, 29093904, 130800096, 344449584, 479320416, 264539520; 9: 512, 34560, 1002240, 16329600, 164003616, 1047135600, 4220501760, 10258779600, 13470730272, 7142567040;
%F FormulaThe row polynomials satisfy P(n,x) = (2+3*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[(2 + 3*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] = (2 + 3*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_A013609 of Triangle read by rows, s_3(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_3(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 ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, s_3(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_A013609 of Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
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
- [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.