A038330 → basis A013609

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
025625664576
140966144307251213824
26553613107298304327684096331776
31048576262144026214401310720327680327687962624
416777216503316486291456041943040157286403145728262144191102976
5268435456939524096140928614411744051205872025601761607682936012820971524586471424
64294967296171798691843006477107230064771072187904819207516192768187904819226843545616777216110075314176
768719476736309237645312618475290624721554505728541165879296270582939648901943132161932735283224159191041342177282641807540224

Computed in your browser ?

Technical details
Node id
n-de403801a492a76b · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-11aec07ce60b6d61

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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 ℚ): yes

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:            256,            256,              64;
  1:           4096,           6144,            3072,             512;
  2:          65536,         131072,           98304,           32768,            4096;
  3:        1048576,        2621440,         2621440,         1310720,          327680,           32768;
  4:       16777216,       50331648,        62914560,        41943040,        15728640,         3145728,          262144;
  5:      268435456,      939524096,      1409286144,      1174405120,       587202560,       176160768,        29360128,        2097152;
  6:     4294967296,    17179869184,     30064771072,     30064771072,     18790481920,      7516192768,      1879048192,      268435456,       16777216;
  7:    68719476736,   309237645312,    618475290624,    721554505728,    541165879296,    270582939648,     90194313216,    19327352832,     2415919104,     134217728;
  8:  1099511627776,  5497558138880,  12369505812480,  16492674416640,  14431090114560,   8658654068736,   3607772528640,  1030792151040,   193273528320,   21474836480,   1073741824;
  9: 17592186044416, 96757023244288, 241892558110720, 362838837166080, 362838837166080, 253987186016256, 126993593008128, 45354854645760, 11338713661440, 1889785610240, 188978561024, 8589934592;
%F Formula
The row polynomials satisfy P(n,x) = (16+8*x)*P(n-1,x) for n >= 1, with P(0,x) = 256 + 256*x + 64*x^2.
%t Mathematica
P[0, x_] := 256 + 256*x + 64*x^2;
P[n_, x_] := P[n, x] = Expand[(16 + 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] = 256 + 256*x + 64*x^2; for(n = 1, N, my(i = n + 1); v[i] = (16 + 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-6efc8fa5932928ce
  • 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-6efc8fa5932928ce
  • 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-6efc8fa5932928ce

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 (67)

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

References

  1. [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