A081581 → basis A007318

nonnegative coefficients

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

Recurrence
\(P_{n}(x) = \left(6 + 6\,x\right)\,P_{n-2}(x) + \left(2 + x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1213
21010121
3324818199
4124248150261549
544011009443163412835
6162448725376263254642115093
75888206082788818200582484050179299

Computed in your browser ?

Other recurrences

X ↦ x+1 substitution · proved equal for all n (proof step)

\(\left(n\right)\,P_{n}(x) = \left(15 + 2\,x - 20\,n - n x + 7\,n^{2}\right)\,P_{n-1}(x) + \left(70 + 73\,x + 4\,x^{2} - 28\,n - 28\,n x - n x^{2}\right)\,P_{n-1}'(x) + \left(28 + 56\,x + 29\,x^{2} + x^{3}\right)\,P_{n-1}''(x)\)
\(P_{0}(x) = 1\)
Technical details
Node id
n-3c441f1bcfbf2753 · revision 2 · JSON
Definition source
derived:basis_map_A007318
derived:shift_x_plus_one (equal by e-79dfc179bcde4672)
Fingerprint
f6-f3ca818af1ab544b

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,      1;
  2:    10,     10,      1;
  3:    32,     48,     18,      1;
  4:   124,    248,    150,     26,      1;
  5:   440,   1100,    944,    316,     34,      1;
  6:  1624,   4872,   5376,   2632,    546,     42,     1;
  7:  5888,  20608,  27888,  18200,   5824,    840,    50,    1;
  8: 21520,  86080, 137872, 112336,  48916,  11032,  1198,   58,  1;
  9: 78368, 352656, 652800, 639072, 354312, 110964, 18768, 1620, 66, 1;
%F Formula
The row polynomials satisfy P(n,x) = (6+6*x)*P(n-2,x) + (2+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[(6 + 6*x)*P[n - 2, x] + (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] = 1; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = (6 + 6*x)*v[i - 2] + (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-0969de847e9e33f8
  • 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-0969de847e9e33f8, e-bea000b54bcb475f
  • 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-0969de847e9e33f8, e-bea000b54bcb475f
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-0969de847e9e33f8, e-bea000b54bcb475f
  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-bea000b54bcb475f

Proof chains

3 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

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