A225470 → basis A013610 → basis A013610
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(3 + 9\,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 | 6 | 9 | 15 | |||||||||||||
| 2 | 54 | 135 | 81 | 270 | ||||||||||||
| 3 | 648 | 2106 | 2187 | 729 | 5670 | |||||||||||
| 4 | 9720 | 37422 | 51759 | 30618 | 6561 | 136080 | ||||||||||
| 5 | 174960 | 761076 | 1268460 | 1016955 | 393660 | 59049 | 3674160 | |||||||||
| 6 | 3674160 | 17557236 | 33487344 | 32772195 | 17419455 | 4782969 | 531441 | 110224800 | ||||||||
| 7 | 88179840 | 454441104 | 961711380 | 1087918776 | 713016675 | 271566351 | 55801305 | 4782969 | 3637418400 | |||||||
| 8 | 2380855680 | 13063528368 | 30056177196 | 38029209372 | 29042719209 | 13749441552 | 3950732394 | 631351908 | 43046721 | 130947062400 | ||||||
| 9 | 71425670400 | 413333552160 | 1019257071192 | 1411381875924 | 1213544460618 | 673867719441 | 242266945788 | 54497148786 | 6973568802 | 387420489 | 5106935433600 | |||||
| 10 | 2357047123200 | 14282838254880 | 37355485318776 | 55748915546220 | 52749404083710 | 33159534887115 | 14059618685973 | 3978808422030 | 720602109540 | 75546995355 | 3486784401 | 214491288211200 | ||||
| 11 | 84853696435200 | 535395601284480 | 1473343015769856 | 2343160327532904 | 2400718786929540 | 1668487892689530 | 804582086679063 | 269773671366837 | 61750951741710 | 9205110818640 | 805447196631 | 31381059609 | 9652107969504000 | |||
| 12 | 3309294160972800 | 21644111718011520 | 62278938026584704 | 104643339915711960 | 114716475638048196 | 86677496897257530 | 46395092414689227 | 17762411963418210 | 4836250160228223 | 914757887602350 | 114258438036369 | 8472886094430 | 282429536481 | 463301182536192000 | ||
| 13 | 138990354760857600 | 938836339605239040 | 2810512402578661248 | 4955530718699164656 | 5759882036039431872 | 4672903150427250024 | 2728691353492265304 | 1163577134195767863 | 362984214400349256 | 81946082721352707 | 13031675385948648 | 1384187158293381 | 88118015382072 | 2541865828329 | 23628360309345792000 | |
| 14 | 6254565964238592000 | 43498548475083475200 | 134922585172486907520 | 248293493964670360752 | 303794468090066916144 | 262119580093581137928 | 164847239260997188896 | 76919193220239941571 | 26806483855777627287 | 6954431652064015119 | 1323940136859863523 | 179573500596739977 | 16422995116833669 | 907446100713453 | 22876792454961 | 1275931456704672768000 |
Compute more
?
Technical details
- Node id
n-f6ce73d04c355dca· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-dd8e883ba3f13bd7
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: 6, 9; 2: 54, 135, 81; 3: 648, 2106, 2187, 729; 4: 9720, 37422, 51759, 30618, 6561; 5: 174960, 761076, 1268460, 1016955, 393660, 59049; 6: 3674160, 17557236, 33487344, 32772195, 17419455, 4782969, 531441; 7: 88179840, 454441104, 961711380, 1087918776, 713016675, 271566351, 55801305, 4782969; 8: 2380855680, 13063528368, 30056177196, 38029209372, 29042719209, 13749441552, 3950732394, 631351908, 43046721; 9: 71425670400, 413333552160, 1019257071192, 1411381875924, 1213544460618, 673867719441, 242266945788, 54497148786, 6973568802, 387420489;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n+3+9*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 + 3 + 9*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 + 3 + 9*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_A013610 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_A013610 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 ?
- A028338 → basis A013609 → basis A013610
- A130534 → basis A013610
- A204420 → basis A013610 → basis A013609
- A130534 → basis A013610 → reverse
- A225471 → basis A013611 → basis A013610
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.