A054142 → basis A013609

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence
\(P_{n}(x) = \left(-1 - 4\,x - 4\,x^{2}\right)\,P_{n-2}(x) + \left(3 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
2510419
3134036897
43414220411216508
589470932840320322683
623314883768475230408646414209
7610457014088228802072010080224012875316
8159713730498929921611656081088313605632256399331
941814056816978839970457795252502429299292928138245122117473
1010946118310560436152456026196802942688215712099532826496033280102411228332
1128657341422180576455742961110136014871136135372168249472321868873216078848204859541067
12750259768005705520197064004464160069499200756896005750272029779200999680019712001843204096315732481
131964182774450177376806777824017212880030549024038763840035338368022898304010250240030018560519168042598481921674257764
1451422978321225439802022784976064121008012780947201852623360197244672015379353608643148803389900808759296013418496974848163848878212019

Computed in your browser ?

Technical details
Node id
n-f475a0646d719a92 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-c03785f2011a6138

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 Example
Triangle begins:
  0:    1;
  1:    2,     2;
  2:    5,    10,      4;
  3:   13,    40,     36,      8;
  4:   34,   142,    204,    112,     16;
  5:   89,   470,    932,    840,    320,     32;
  6:  233,  1488,   3768,   4752,   3040,    864,     64;
  7:  610,  4570,  14088,  22880,  20720,  10080,   2240,   128;
  8: 1597, 13730,  49892,  99216, 116560,  81088,  31360,  5632,   256;
  9: 4181, 40568, 169788, 399704, 577952, 525024, 292992, 92928, 13824, 512;
%F Formula
The row polynomials satisfy P(n,x) = -(1+4*x+4*x^2)*P(n-2,x) + (3+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(1 + 4*x + 4*x^2)*P[n - 2, x] + (3 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(1 + 4*x + 4*x^2)*v[i - 2] + (3 + 4*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-dfc51938f5f39b6d
  • 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-dfc51938f5f39b6d
  • 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-dfc51938f5f39b6d
  • 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-dfc51938f5f39b6d

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

No candidate equalities or related sequences.

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023