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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16x17Pn(1)
082424864
1840725616192
285615220012832576
3872264504528288641728
48884081032153613446401285184
581045841848360044163328140825615552
681207923016729611616121608064307251246656
7813610324600133282620835392323841920066561024139968
88152130466642252852864878081031688396845056143362048419904
981681608927235856979201935362787842903042129921044483072040961259712
108184194412488544001696323893766658568478727936005304322396166553681923779136
11820023121637679376278432728640144460821795842489344211763213004805447681392641638411337408
128216271221000112128437184128550429018885068800684851270963205535744314572812288002949123276834012224
1382323144264241541286614402159872547289610872576169861122079334419728384142172167520256275251262259265536102036672
148248360832712206976969696348275297926402181836838731264547655686131507253673984359546881779302461276161310720131072306110016

Computed in your browser ?

Technical details
Node id
n-48e70e0cceeb235f · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-f9d50fb492dc5697

Observed on the stored rows ?

  • Degrees: 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 (affine: slope 1, intercept 3)
  • 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: 8,  24,   24,    8;
  1: 8,  40,   72,   56,    16;
  2: 8,  56,  152,  200,   128,    32;
  3: 8,  72,  264,  504,   528,   288,     64;
  4: 8,  88,  408, 1032,  1536,  1344,    640,    128;
  5: 8, 104,  584, 1848,  3600,  4416,   3328,   1408,    256;
  6: 8, 120,  792, 3016,  7296, 11616,  12160,   8064,   3072,    512;
  7: 8, 136, 1032, 4600, 13328, 26208,  35392,  32384,  19200,   6656,   1024;
  8: 8, 152, 1304, 6664, 22528, 52864,  87808, 103168,  83968,  45056,  14336,  2048;
  9: 8, 168, 1608, 9272, 35856, 97920, 193536, 278784, 290304, 212992, 104448, 30720, 4096;
%F Formula
The row polynomials satisfy P(n,x) = (1+2*x)*P(n-1,x) for n >= 1, with P(0,x) = 8 + 24*x + 24*x^2 + 8*x^3.
%t Mathematica
P[0, x_] := 8 + 24*x + 24*x^2 + 8*x^3;
P[n_, x_] := P[n, x] = Expand[(1 + 2*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] = 8 + 24*x + 24*x^2 + 8*x^3; for(n = 1, N, my(i = n + 1); v[i] = (1 + 2*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-5fbd3e16dd967779
  • 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-5fbd3e16dd967779
  • 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-5fbd3e16dd967779

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.