Real-rooted atlas

A274496 → basis A013609

palindromic γ-positive nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3Pn(1)
011
122
2448
38816
416321664
5326432128
66419219264512
71283843841281024

Show all 15 stored rows

Computed in your browser ?

Technical details
Node id
n-2b301932743053f0 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-6052c7b42ebfb2ec

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
  • Palindromic rows: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

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:   4,    4;
  3:   8,    8;
  4:  16,   32,   16;
  5:  32,   64,   32;
  6:  64,  192,  192,   64;
  7: 128,  384,  384,  128;
  8: 256, 1024, 1536, 1024, 256;
  9: 512, 2048, 3072, 2048, 512;
%F Formula
The row polynomials satisfy P(n,x) = (4+4*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(4 + 4*x)*P[n - 2, 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; for(n = 2, N, my(i = n + 1); v[i] = (4 + 4*x)*v[i - 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)

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-267456e89d3343d1
  • 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-267456e89d3343d1
  • 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-267456e89d3343d1

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

Same fingerprint (6)

Equal up to content, sign, reversal and a small index shift.