A249248 → x ↦ x+1

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1437
21113327
33865313137
4131288207523681
5490132512785157633687
618976073734641211052103320595
777142856341589299321095318901333120777
832501136570232512204656983952512831101663733041
91421426684111303114135703481029627708151578480220234614663
1064179533387457334541882603063111872723211690855972187065241329970891
112989294170459214166612756908377474563642480613380488291561851171396100072833200664585
121432192388828156239130893365570304348604926214515804852866492141748032603222863881374532831381236921
137049396247247124513890586142350314557252388653017893114928450585702626711295220358263727404579381840537639762319143
1435581676925626876378169974208151602056831811071606714549320464797646542729709627637372453231181497121179061170584324122427370724065059

Computed in your browser ?

Technical details
Node id
n-5bdff9de6e987505 · revision 2 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-6f72b1b66f13d328

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:      4,      3;
  2:     11,     13,       3;
  3:     38,     65,      31,       3;
  4:    131,    288,     207,      52,      3;
  5:    490,   1325,    1278,     515,     76,      3;
  6:   1897,   6073,    7346,    4121,   1052,    103,     3;
  7:   7714,  28563,   41589,   29932,  10953,   1890,   133,    3;
  8:  32501, 136570,  232512,  204656,  98395,  25128,  3110,  166,   3;
  9: 142142, 668411, 1303114, 1357034, 810296, 277081, 51578, 4802, 202, 3;
%F Formula
The row polynomials satisfy P(n,x) = (n+1+(n+1)*x)*P(n-2,x) + (2+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (n + 1)*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] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (n + 1)*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-597992a3fe650259
  • 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-3422677120930982, e-597992a3fe650259
  • 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-3422677120930982, e-597992a3fe650259
  • 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-3422677120930982, e-597992a3fe650259
  • 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-3422677120930982

Proof chains

2 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

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