A391533 → basis A013611

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
09241649
1188412864294
2362405926402561764
372624214436483072102410584
414415366784158722073614336409663504
5288364819712588801049601116166553616384381024
6576844854016196608445440643072577536294912655362286144
71152192001418246092801677312306790437273602899968131072026214413716864
823044300836044817858565791744128450561972633620709376142213125767168104857682301184
9460895232892928501350418726912488570889083289612032409611128012868419584251658244194304493807104
10921620889621667841359872057507840172621824377094144603979776703856640581959680324009984109051904167772162962842624
11184324546565169152358645761694105605752750081444675584271633612838236323843979345920297585868815141437444697620486710886417777055744
1236864983040121569289240576048227942418281922565190451200112113745921851260928023253221376218691010561493172224069960990722013265920268435456106662334464
137372821135362824601623343923213341818885585502208176936714244318455398481870716928120556879872136751087616117339848704737190871043201092812885899345921073741824639974006784
14147456452198464946176579862528360212070416507731968577293516801571437936643364796497925685966274567557296947207816840478726167975690243588982046721452235816963650722201642949672963839844040704

Computed in your browser ?

Technical details
Node id
n-d021e887e4fd1eea · revision 1 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-19b2ced286a4e317

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 ?

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:    9,    24,     16;
  1:   18,    84,    128,      64;
  2:   36,   240,    592,     640,      256;
  3:   72,   624,   2144,    3648,     3072,     1024;
  4:  144,  1536,   6784,   15872,    20736,    14336,     4096;
  5:  288,  3648,  19712,   58880,   104960,   111616,    65536,     16384;
  6:  576,  8448,  54016,  196608,   445440,   643072,   577536,    294912,     65536;
  7: 1152, 19200, 141824,  609280,  1677312,  3067904,  3727360,   2899968,   1310720,   262144;
  8: 2304, 43008, 360448, 1785856,  5791744, 12845056, 19726336,  20709376,  14221312,  5767168,  1048576;
  9: 4608, 95232, 892928, 5013504, 18726912, 48857088, 90832896, 120324096, 111280128, 68419584, 25165824, 4194304;
%F Formula
The row polynomials satisfy P(n,x) = (2+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 9 + 24*x + 16*x^2.
%t Mathematica
P[0, x_] := 9 + 24*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[(2 + 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] = 9 + 24*x + 16*x^2; for(n = 1, N, my(i = n + 1); v[i] = (2 + 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-3d28f25fd9699ebd
  • 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-3d28f25fd9699ebd
  • 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-3d28f25fd9699ebd

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