A001263 → basis A013609 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2 + n\right)\,P_{n}(x) = \left(2 + 10\,n + 6\,n x\right)\,P_{n-1}(x) + \left(-6 - 10\,x - 4\,x^{2}\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 | 4 | 2 | 6 | |||||||||||||
| 2 | 19 | 18 | 4 | 41 | ||||||||||||
| 3 | 100 | 138 | 60 | 8 | 306 | |||||||||||
| 4 | 562 | 1016 | 656 | 176 | 16 | 2426 | ||||||||||
| 5 | 3304 | 7380 | 6320 | 2560 | 480 | 32 | 20076 | |||||||||
| 6 | 20071 | 53358 | 56940 | 30920 | 8880 | 1248 | 64 | 171481 | ||||||||
| 7 | 124996 | 385322 | 492436 | 335720 | 130480 | 28448 | 3136 | 128 | 1500666 | |||||||
| 8 | 793774 | 2783376 | 4144224 | 3402336 | 1671264 | 497280 | 86016 | 7680 | 256 | 13386206 | ||||||
| 9 | 5120632 | 20124540 | 34210080 | 32860800 | 19535040 | 7390656 | 1757952 | 248832 | 18432 | 512 | 121267476 | |||||
| 10 | 33463102 | 145681220 | 278392200 | 306338400 | 213897600 | 98380800 | 29917440 | 5863680 | 695040 | 43520 | 1024 | 1112674026 | ||||
| 11 | 221060008 | 1055949444 | 2240786680 | 2779458000 | 2230113600 | 1209035520 | 448842240 | 113034240 | 18670080 | 1886720 | 101376 | 2048 | 10318939956 | |||
| 12 | 1473830308 | 7663801296 | 17881039968 | 24685554080 | 22383266400 | 13984185600 | 6139330560 | 1894717440 | 403983360 | 57221120 | 5001216 | 233472 | 4096 | 96572168916 | ||
| 13 | 9904186192 | 55691336168 | 141697186592 | 215493394688 | 217932100672 | 154229989056 | 78235762176 | 28640342016 | 7510204416 | 1379096576 | 169861120 | 12992512 | 532480 | 8192 | 910896992856 | |
| 14 | 67015401391 | 405177610950 | 1116467659580 | 1854617248120 | 2069856188400 | 1637003400032 | 942697339584 | 399735033984 | 124688788224 | 28253249024 | 4529581056 | 490706944 | 33173504 | 1204224 | 16384 | 8650566601401 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(\left(2 + n\right)\,P_{n}(x) = \left(4 + 8\,x + 4\,x^{2} - 4\,n - 8\,n x - 4\,n x^{2}\right)\,P_{n-2}(x) + \left(4 + 2\,x + 8\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 2\,x\)
Technical details
- Node id
n-14506fb9ff389955· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-cdca5f77258a98bd)- Fingerprint
f6-1afe30f8794f3fd0
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: 19, 18, 4; 3: 100, 138, 60, 8; 4: 562, 1016, 656, 176, 16; 5: 3304, 7380, 6320, 2560, 480, 32; 6: 20071, 53358, 56940, 30920, 8880, 1248, 64; 7: 124996, 385322, 492436, 335720, 130480, 28448, 3136, 128; 8: 793774, 2783376, 4144224, 3402336, 1671264, 497280, 86016, 7680, 256; 9: 5120632, 20124540, 34210080, 32860800, 19535040, 7390656, 1757952, 248832, 18432, 512;
%F FormulaThe row polynomials satisfy (n+2)*P(n,x) = (10*n+2+6*n*x)*P(n-1,x) - (6+10*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((10*n + 2 + 6*n*x)*P[n - 1, x] - (6 + 10*x + 4*x^2)*D[P[n - 1, x], x])/(n + 2)]];
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] = ((10*n + 2 + 6*n*x)*v[i - 1] - (6 + 10*x + 4*x^2)*deriv(v[i - 1], x))/(n + 2)); 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 (−∞, -1]
- 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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also c…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also c…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
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: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
Related ?
Same fingerprint ?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023