A054142 → basis A013611

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 - 8\,x - 16\,x^{2}\right)\,P_{n-2}(x) + \left(3 + 8\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 4\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1246
25201641
3138014464301
4342848168962562286
589940372867205120102417621
62332976150723801648640276484096136681
7610914056352183040331520322560143360163841062966
8159727460199568793728186496025948162007040720896655368275601
941818113667915231976329247232168007681875148811894784353894426214464457461
1010946236620224174412196480419148809416601613805568012740198467829760170393601048576502142046
112865768284472230564459436817762176047587635286638182410559324168239841283748659208074035241943043912125981
12750251953600228220801576512007142656002223974400484413440073603481607623475200511836160020185088003774873601677721630479834641
1319641855489007095072054222592027540608009775687680248088576004523311104058619658240524812288003073900544010632560640174483046467108864237475031526
1451422915664244217592080182279808010259361280408990310401185678950402524731801603937114521604425292185603471258419201793903820805496215961679859548162684354561850229480761

Computed in your browser ?

Technical details
Node id
n-f6ae76e028fdbc79 · revision 1 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-7127ff2d2cff7862

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,     4;
  2:    5,    20,     16;
  3:   13,    80,    144,      64;
  4:   34,   284,    816,     896,     256;
  5:   89,   940,   3728,    6720,    5120,     1024;
  6:  233,  2976,  15072,   38016,   48640,    27648,     4096;
  7:  610,  9140,  56352,  183040,  331520,   322560,   143360,    16384;
  8: 1597, 27460, 199568,  793728, 1864960,  2594816,  2007040,   720896,   65536;
  9: 4181, 81136, 679152, 3197632, 9247232, 16800768, 18751488, 11894784, 3538944, 262144;
%F Formula
The row polynomials satisfy P(n,x) = -(1+8*x+16*x^2)*P(n-2,x) + (3+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(1 + 8*x + 16*x^2)*P[n - 2, x] + (3 + 8*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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(1 + 8*x + 16*x^2)*v[i - 2] + (3 + 8*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-9b1bc1b4b9a11aaa
  • 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-9b1bc1b4b9a11aaa
  • 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-9b1bc1b4b9a11aaa
  • 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-9b1bc1b4b9a11aaa

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