A113953 → 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(2 + 6\,x\right)\,P_{n-2}(x) + \left(1 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 3\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1134
2312924
35336327128
4119025227081704
521219846145810532433840
643528254760487209388872920992
78512217137216813620732319138512187114688
817127901906270470151956191970135594481146561626688
9341625549032213840565866929718933120542376164025196833424256
1068313884122661616248193411839229925145282425152820929595511245904918710528
11136530489299907170610361976341497997824358806263708461842984978535171830519177147102236160
122731664507200004574286188816675302357210312725613882201212723747376803066288159126022998531441558628864
135461143811170209811945934552364111768143334007954526470983087387882835848016133100072501038081421966331715943233052404736
141092330948039722313052080015628326356186071214556343952745892224376749022537181974322582862309121877136036828861363772920478296916678649856

Computed in your browser ?

Technical details
Node id
n-ad5020a0c2e8a31d · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-354f21f96faadf4a

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 ?

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:   1,    3;
  2:   3,   12,     9;
  3:   5,   33,    63,     27;
  4:  11,   90,   252,    270,     81;
  5:  21,  219,   846,   1458,   1053,    243;
  6:  43,  528,  2547,   6048,   7209,   3888,    729;
  7:  85, 1221,  7137,  21681,  36207,  32319,  13851,   2187;
  8: 171, 2790, 19062,  70470, 151956, 191970, 135594,  48114,   6561;
  9: 341, 6255, 49032, 213840, 565866, 929718, 933120, 542376, 164025, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (2+6*x)*P(n-2,x) + (1+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[(2 + 6*x)*P[n - 2, x] + (1 + 3*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] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 6*x)*v[i - 2] + (1 + 3*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-900137e7780f9cba
  • 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-900137e7780f9cba
  • 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-900137e7780f9cba

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
  2. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741