A225470 → basis A013611 → basis A013609
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(4 + 8\,x + 3\,n\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 | 7 | 8 | 15 | |||||||||||||
| 2 | 70 | 136 | 64 | 270 | ||||||||||||
| 3 | 910 | 2328 | 1920 | 512 | 5670 | |||||||||||
| 4 | 14560 | 44528 | 49344 | 23552 | 4096 | 136080 | ||||||||||
| 5 | 276640 | 962512 | 1293760 | 842240 | 266240 | 32768 | 3674160 | |||||||||
| 6 | 6086080 | 23388384 | 36162816 | 28879360 | 12595200 | 2850816 | 262144 | 110224800 | ||||||||
| 7 | 152152000 | 633398240 | 1091177472 | 1011286528 | 545914880 | 172032000 | 29360128 | 2097152 | 3637418400 | |||||||
| 8 | 4260256000 | 18952366720 | 35620155136 | 37045442560 | 23375908864 | 9184215040 | 2198339584 | 293601280 | 16777216 | 130947062400 | ||||||
| 9 | 132067936000 | 621605416320 | 1255843742976 | 1433369960448 | 1021016715264 | 471717937152 | 141622247424 | 26688356352 | 2868903936 | 134217728 | 5106935433600 | |||||
| 10 | 4490309824000 | 22191127642880 | 47671530591744 | 58781328599040 | 46181528002560 | 24206543585280 | 8588899909632 | 2040382095360 | 311049584640 | 27514634240 | 1073741824 | 214491288211200 | ||||
| 11 | 166141463488000 | 856994201378560 | 1941375653037568 | 2556281402898432 | 2178967164887040 | 1265094336675840 | 511441645338624 | 144205336805376 | 27831891394560 | 3506438144000 | 259845521408 | 8589934592 | 9652107969504000 | |||
| 12 | 6645658539520000 | 35608899763046400 | 84510979732531200 | 117782261340237824 | 107608937818669056 | 68035510786129920 | 30578420506951680 | 9859746634924032 | 2266918350225408 | 362912656916480 | 38445326008320 | 2422361554944 | 68719476736 | 463301182536192000 | ||
| 13 | 285763317199360000 | 1584347958127155200 | 3918843326603212800 | 5740725075490476032 | 5569442416924672000 | 3786398466352939008 | 1859156168087961600 | 668596469357346816 | 176355462139084800 | 33740591049211904 | 4556450273689600 | 411724154929152 | 22333829939200 | 549755813888 | 23628360309345792000 | |
| 14 | 13145112591170560000 | 75166112611444019200 | 192941576688765030400 | 295424100085387599872 | 302120151782458720256 | 218729868787632570368 | 115812371462869745664 | 45628686935141646336 | 13461123013256675328 | 2962910885376425984 | 479521440983416832 | 55390913316257792 | 4321149416636416 | 203959406952448 | 4398046511104 | 1275931456704672768000 |
Compute more
?
Technical details
- Node id
n-5a9991b9bc42a2c4· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-c64c50ff95d2b5b0
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: 7, 8; 2: 70, 136, 64; 3: 910, 2328, 1920, 512; 4: 14560, 44528, 49344, 23552, 4096; 5: 276640, 962512, 1293760, 842240, 266240, 32768; 6: 6086080, 23388384, 36162816, 28879360, 12595200, 2850816, 262144; 7: 152152000, 633398240, 1091177472, 1011286528, 545914880, 172032000, 29360128, 2097152; 8: 4260256000, 18952366720, 35620155136, 37045442560, 23375908864, 9184215040, 2198339584, 293601280, 16777216; 9: 132067936000, 621605416320, 1255843742976, 1433369960448, 1021016715264, 471717937152, 141622247424, 26688356352, 2868903936, 134217728;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n+4+8*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[(3*n + 4 + 8*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] = (3*n + 4 + 8*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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013611 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_A013611 of Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
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.