A026374 → basis A013610

nonnegative coefficients

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

Recurrence
\(P_{n}(x) = \left(5 + 15\,x + 9\,x^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 3\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1235
2515929
310456327145
42515031527081841
550375108014859722434205
61251125405074257290364572924389
7250262511475270003685529160123932187121945
8625750038250108000184275194400123930437406561707281
912501687599000330750692550941625831060459270144342196833536405
103125468753093751181250288562547081255194125382725018042754920755904920511149
116250103125759375329062593150001807312524512625232368751509030063969751594323177147102555745
1215625281250227812510968750349312507745625012256312513942125011317725063969750239148455314410531441594823321
1331250609375540000028771875102768750259706250477495000646531875644618250467471250239738940823733551700611215943232974116605
14781251640625157500009154687535969062510099687502089040625323265937537602731253272298750209771572596102247529760696055801305478296917249876309

Computed in your browser ?

Technical details
Node id
n-15c34e3bd51729df · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-6ebcce6f82f6c3c8

Observed on the stored rows ?

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

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,     3;
  2:    5,    15,     9;
  3:   10,    45,    63,     27;
  4:   25,   150,   315,    270,     81;
  5:   50,   375,  1080,   1485,    972,    243;
  6:  125,  1125,  4050,   7425,   7290,   3645,    729;
  7:  250,  2625, 11475,  27000,  36855,  29160,  12393,   2187;
  8:  625,  7500, 38250, 108000, 184275, 194400, 123930,  43740,   6561;
  9: 1250, 16875, 99000, 330750, 692550, 941625, 831060, 459270, 144342, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (5+15*x+9*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 3*x;
P[n_, x_] := P[n, x] = Expand[(5 + 15*x + 9*x^2)*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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (5 + 15*x + 9*x^2)*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-fd8eb8561f83d912
  • 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-fd8eb8561f83d912
  • 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-fd8eb8561f83d912

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.