A085841 → basis A013609
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means
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 | 61 | 144 | 64 | 269 | ||||||||||||
| 3 | 547 | 2008 | 2112 | 512 | 5179 | |||||||||||
| 4 | 4921 | 24608 | 41856 | 26624 | 4096 | 102105 | ||||||||||
| 5 | 44287 | 280488 | 661888 | 701440 | 307200 | 32768 | 2028071 | |||||||||
| 6 | 398581 | 3055792 | 9233856 | 13780992 | 10301440 | 3342336 | 262144 | 40375141 | ||||||||
| 7 | 3587227 | 32285048 | 118976448 | 229516800 | 244715520 | 138313728 | 34865152 | 2097152 | 804357075 | |||||||
| 8 | 32285041 | 333612096 | 1451033344 | 3435966464 | 4774256640 | 3892051968 | 1739587584 | 352321536 | 16777216 | 16027891889 | ||||||
| 9 | 290565367 | 3389929288 | 16998074112 | 47733434368 | 81884291072 | 87628382208 | 57054068736 | 20812136448 | 3472883712 | 134217728 | 319397983039 | |||||
| 10 | 2615088301 | 33996147920 | 193080686400 | 627379056640 | 1281817026560 | 1702337839104 | 1464567595008 | 785224040448 | 239326986240 | 33554432000 | 1073741824 | 6364972640445 | ||||
| 11 | 23535794707 | 337346390808 | 2140449774400 | 7900617607680 | 18740194959360 | 29758409605120 | 31922837782528 | 22751200935936 | 10275155607552 | 2664892989440 | 318901321728 | 8589934592 | 126842132703851 | |||
| 12 | 211822152361 | 3318547053664 | 23265133067904 | 96163334543360 | 259804119429120 | 480426697949184 | 618433317175296 | 551961531252736 | 333193748152320 | 129007395799040 | 28890097516544 | 2989297238016 | 68719476736 | 2527733760806281 | ||
| 13 | 1906399371247 | 32408789311208 | 248785117948032 | 1138438157868032 | 3451774361620480 | 7288138318970880 | 10956078660452352 | 11772953150619648 | 8935726318092288 | 4647905562460160 | 1564624373678080 | 306196808466432 | 27693949124608 | 549755813888 | 50373179723797335 | |
| 14 | 17157594341221 | 314555896255728 | 2624158734521536 | 13170360056264704 | 44289708492804096 | 105160881550721024 | 180917154708455424 | 227627028398997504 | 208651884058116096 | 136970772240400384 | 62235966978392064 | 18425856376438784 | 3183017442934784 | 253987186016256 | 4398046511104 | 1003846887761170709 |
Computed in your browser ?
Technical details
- Node id
n-393cac5827041b9e· revision 1 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-51bc43062169a582
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
OEIS matches ?
No OEIS matches.
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 7, 8; 2: 61, 144, 64; 3: 547, 2008, 2112, 512; 4: 4921, 24608, 41856, 26624, 4096; 5: 44287, 280488, 661888, 701440, 307200, 32768; 6: 398581, 3055792, 9233856, 13780992, 10301440, 3342336, 262144; 7: 3587227, 32285048, 118976448, 229516800, 244715520, 138313728, 34865152, 2097152; 8: 32285041, 333612096, 1451033344, 3435966464, 4774256640, 3892051968, 1739587584, 352321536, 16777216; 9: 290565367, 3389929288, 16998074112, 47733434368, 81884291072, 87628382208, 57054068736, 20812136448, 3472883712, 134217728;
%F FormulaThe row polynomials satisfy P(n,x) = -(9+48*x+64*x^2)*P(n-2,x) + (10+16*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 7 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(9 + 48*x + 64*x^2)*P[n - 2, x] + (10 + 16*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; v[2] = 7 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(9 + 48*x + 64*x^2)*v[i - 2] + (10 + 16*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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-b4660546a5e77fa6 -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-b4660546a5e77fa6 -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-b4660546a5e77fa6 -
Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
The roots of consecutive polynomials alternate on the real line.by the cited steps:
e-b4660546a5e77fa6
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
basis_map A013609
e-b4660546a5e77fa6Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-c0dcd56725ae4481root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).
Related sequences ?
No candidate equalities or related sequences.
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023