A200536 → 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(6 + 14\,x + 8\,x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1614828
23616829222464784
32161512439267765856268851221952
41296120964924811424016513615232087552286724096614656
57776907204752001471680298416041397443978880261632011264002867203276817210368
64665665318441834881620864042310080783901441057029761045201927521792038420480132218882752512262144481890304
727993645722883461875216104614451424934411923511042070160512273408396827602140162119735296121896140850898534414588313625690112209715213492928512

Generated b-files: A009972 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-83675781d9687218 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-a0b8814ff2967252

Observed on the stored rows ?

  • Degrees: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28 (affine: slope 2, 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 ℚ): yes

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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:        6,        14,          8;
  2:       36,       168,        292,         224,          64;
  3:      216,      1512,       4392,        6776,        5856,         2688,          512;
  4:     1296,     12096,      49248,      114240,      165136,       152320,        87552,        28672,          4096;
  5:     7776,     90720,     475200,     1471680,     2984160,      4139744,      3978880,      2616320,       1126400,        286720,         32768;
  6:    46656,    653184,    4183488,    16208640,    42310080,     78390144,    105702976,    104520192,      75217920,      38420480,      13221888,       2752512,        262144;
  7:   279936,   4572288,   34618752,   161046144,   514249344,   1192351104,   2070160512,   2734083968,    2760214016,    2119735296,    1218961408,     508985344,     145883136,     25690112,      2097152;
  8:  1679616,  31352832,  273964032,  1487517696,  5617092096,  15641966592,  33227873280,  54925559808,   71399743744,   73234079744,   59071774720,   37077254144,   17752784896,   6268387328,   1539309568,   234881024,    16777216;
  9: 10077696, 211631616, 2096160768, 13011425280, 56719512576, 184391230464, 463291508736, 919879317504, 1463179286016, 1878405369344, 1950905714688, 1635341008896, 1098172465152, 582767345664, 239015559168, 73106718720, 15703474176, 2113929216, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (6+14*x+8*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(6 + 14*x + 8*x^2)*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; for(n = 1, N, my(i = n + 1); v[i] = (6 + 14*x + 8*x^2)*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-185113cbc4b6c77b
  • 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-185113cbc4b6c77b
  • 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-185113cbc4b6c77b

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.