A030528 → basis A013609 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(3 + 2\,x\right)\,P_{n-2}(x) + \left(2\,x\right)\,P_{n-2}'(x) + \left(3 + 2\,x\right)\,P_{n-1}(x) + \left(2\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 2 | 6 | |||||||||||||
| 2 | 15 | 20 | 4 | 39 | ||||||||||||
| 3 | 57 | 148 | 72 | 8 | 285 | |||||||||||
| 4 | 216 | 984 | 868 | 224 | 16 | 2308 | ||||||||||
| 5 | 819 | 6206 | 8844 | 3968 | 640 | 32 | 20509 | |||||||||
| 6 | 3105 | 38020 | 82364 | 57152 | 15600 | 1728 | 64 | 198033 | ||||||||
| 7 | 11772 | 228978 | 726908 | 732496 | 300880 | 55360 | 4480 | 128 | 2061002 | |||||||
| 8 | 44631 | 1364744 | 6198900 | 8725376 | 5060576 | 1375104 | 182336 | 11264 | 256 | 22963187 | ||||||
| 9 | 169209 | 8081416 | 51668100 | 98972464 | 77891760 | 29318944 | 5663168 | 567296 | 27648 | 512 | 272360517 | |||||
| 10 | 641520 | 47658480 | 423961320 | 1085014560 | 1127871376 | 564927296 | 149070656 | 21526528 | 1687296 | 66560 | 1024 | 3422426616 | ||||
| 11 | 2432187 | 280320938 | 3440885732 | 11607142056 | 15631368544 | 10136727392 | 3509499840 | 685062656 | 76771584 | 4838400 | 157696 | 2048 | 45375209073 | |||
| 12 | 9221121 | 1646044504 | 27709888200 | 121959103648 | 209735952352 | 172639990784 | 76281866816 | 19329157120 | 2903897088 | 259921920 | 13460480 | 368640 | 4096 | 632488876769 | ||
| 13 | 34959924 | 9655133826 | 221908148408 | 1264397759200 | 2746173021264 | 2826831978080 | 1562423936192 | 499824469504 | 96661144320 | 11521304064 | 842738688 | 36503552 | 851968 | 8192 | 9240311957182 | |
| 14 | 132543135 | 56594253740 | 1769928612916 | 12976447838848 | 35287712435472 | 44904953542464 | 30579530982848 | 12103023258624 | 2930043040000 | 446535828480 | 43255032832 | 2634203136 | 96858112 | 1949696 | 16384 | 141100890396687 |
Compute more
?
Technical details
- Node id
n-22eddc5a9752c540· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-06541b61383eaca3
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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 2; 2: 15, 20, 4; 3: 57, 148, 72, 8; 4: 216, 984, 868, 224, 16; 5: 819, 6206, 8844, 3968, 640, 32; 6: 3105, 38020, 82364, 57152, 15600, 1728, 64; 7: 11772, 228978, 726908, 732496, 300880, 55360, 4480, 128; 8: 44631, 1364744, 6198900, 8725376, 5060576, 1375104, 182336, 11264, 256; 9: 169209, 8081416, 51668100, 98972464, 77891760, 29318944, 5663168, 567296, 27648, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (3+2*x)*P(n-2,x) + 2*x*d/dx P(n-2,x) + (3+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 2, x] + 2*x*D[P[n - 2, x], x] + (3 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 2] + 2*x*deriv(v[i - 2], x) + (3 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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 Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
References
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741