A156289: Triangle read by rows: T(n,k) is the number of end rhyme patterns of a poem of an even number of lines (2n) with 1<=k<=n evenly rhymed sounds.
A156289 ↗ nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence from A156289
\(P_{n}(x) = \left(1 + 3\,x\right)\,P_{n-1}(x) + \left(3\,x + 2\,x^{2}\right)\,P_{n-1}'(x) + \left(x^{2}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 1 | 3 | 4 | |||||||||||||
| 3 | 1 | 15 | 15 | 31 | ||||||||||||
| 4 | 1 | 63 | 210 | 105 | 379 | |||||||||||
| 5 | 1 | 255 | 2205 | 3150 | 945 | 6556 | ||||||||||
| 6 | 1 | 1023 | 21120 | 65835 | 51975 | 10395 | 150349 | |||||||||
| 7 | 1 | 4095 | 195195 | 1201200 | 1891890 | 945945 | 135135 | 4373461 | ||||||||
| 8 | 1 | 16383 | 1777230 | 20585565 | 58108050 | 54864810 | 18918900 | 2027025 | 156297964 | |||||||
| 9 | 1 | 65535 | 16076985 | 341809650 | 1637971335 | 2614321710 | 1640268630 | 413513100 | 34459425 | 6698486371 | ||||||
| 10 | 1 | 262143 | 145020540 | 5581493295 | 44025570225 | 112133266245 | 114359345100 | 51068867850 | 9820936125 | 654729075 | 337789490599 | |||||
| 11 | 1 | 1048575 | 1306495575 | 90319036500 | 1150872695280 | 4521078857295 | 7061340371085 | 4983797718900 | 1663666579575 | 252070693875 | 13749310575 | 19738202807236 | ||||
| 12 | 1 | 4194303 | 11763703050 | 1454250053025 | 29584688710500 | 175418438510700 | 404779703328000 | 424883159575875 | 219481554166875 | 56816734399425 | 6957151150950 | 316234143225 | 1319703681935929 | |||
| 13 | 1 | 16777215 | 105894298965 | 23350346769750 | 752705468239725 | 6640495362200700 | 22114645163711100 | 33264217762776000 | 25001019600306750 | 9851822969113125 | 2034966711652875 | 205552193096250 | 7905853580625 | 99896787342523081 | ||
| 14 | 1 | 67108863 | 953132576760 | 374346808408755 | 19027789826920875 | 247337593189862175 | 1169944052730453000 | 2460629614273330500 | 2590574289592038750 | 1460201669317140750 | 453119254461373500 | 76403750173876125 | 6474894082531875 | 213458046676875 | 8484301665702298804 | |
| 15 | 1 | 268435455 | 8578528735155 | 5996220862577400 | 479063866948700670 | 9113459042931167925 | 60542647295260405275 | 175029456104449947000 | 251667220899601757250 | 195241078433962811250 | 85491664845486149250 | 21423882877649752500 | 3004350854294790000 | 216659917377028125 | 6190283353629375 | 802221679220975886631 |
b-files: A156289 ?
Compute more
?
Technical details
- Node id
n-67b93749ab954f15· revision 0 · JSON- Definition source
oeis_catalog:A156289- Fingerprint
f6-7e5db8abc6982e99
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 -1)
- 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 ℚ): no
Matches ?
Row sums ? A005046
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 3; 3: 1, 15, 15; 4: 1, 63, 210, 105; 5: 1, 255, 2205, 3150, 945; 6: 1, 1023, 21120, 65835, 51975, 10395; 7: 1, 4095, 195195, 1201200, 1891890, 945945, 135135; 8: 1, 16383, 1777230, 20585565, 58108050, 54864810, 18918900, 2027025; 9: 1, 65535, 16076985, 341809650, 1637971335, 2614321710, 1640268630, 413513100, 34459425; 10: 1, 262143, 145020540, 5581493295, 44025570225, 112133266245, 114359345100, 51068867850, 9820936125, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (1+3*x)*P(n-1,x) + (3*x+2*x^2)*d/dx P(n-1,x) + x^2*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + 3*x)*P[n - 1, x] + (3*x + 2*x^2)*D[P[n - 1, x], x] + x^2*D[P[n - 1, x], {x, 2}]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + 3*x)*v[i - 1] + (3*x + 2*x^2)*deriv(v[i - 1], x) + x^2*deriv(deriv(v[i - 1], x), x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
A156289 triangle, offset 1, from P1
%e ExampleTriangle begins: 1: 1; 2: 1, 3; 3: 1, 15, 15; 4: 1, 63, 210, 105; 5: 1, 255, 2205, 3150, 945; 6: 1, 1023, 21120, 65835, 51975, 10395; 7: 1, 4095, 195195, 1201200, 1891890, 945945, 135135; 8: 1, 16383, 1777230, 20585565, 58108050, 54864810, 18918900, 2027025; 9: 1, 65535, 16076985, 341809650, 1637971335, 2614321710, 1640268630, 413513100, 34459425; 10: 1, 262143, 145020540, 5581493295, 44025570225, 112133266245, 114359345100, 51068867850, 9820936125, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (1+3*x)*P(n-1,x) + (3*x+2*x^2)*d/dx P(n-1,x) + x^2*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + 3*x)*P[n - 1, x] + (3*x + 2*x^2)*D[P[n - 1, x], x] + x^2*D[P[n - 1, x], {x, 2}]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + 3*x)*v[i - 1] + (3*x + 2*x^2)*deriv(v[i - 1], x) + x^2*deriv(deriv(v[i - 1], x), x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Iterated real-rootedness preservers
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Iterated real-rootedness preservers
Proof chains ? JSON
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.