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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
21111123
33654201111
4149298178291655
5550137511723833813519
6214364297051338766947119727
7813628476383602471076721036561108447
83127312509219955616084668446147561484651601519
91194985377419920569627385244121589142536820137413322815
104579072289535479438954403463616606142465432333040237262383118389711
1117523009637650225868922935863923083608112491963361288595471600923314921101688543
126709949402596941043989021529473151389245198087082030207660709719910156758566240861011562521583
132568599816695898747462929277391224979789208254099578724355952872099371137174901630841117676493911013111204351
1498341639688391473212882774338238773094412799251341845102918056642036488922831563244692468853124944291568635873119117208915215

Computed in your browser ?

Other recurrences

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

\(\left(n\right)\,P_{n}(x) = \left(17 + 2\,x - 23\,n - n x + 8\,n^{2}\right)\,P_{n-1}(x) + \left(80 + 83\,x + 4\,x^{2} - 32\,n - 32\,n x - n x^{2}\right)\,P_{n-1}'(x) + \left(32 + 64\,x + 33\,x^{2} + x^{3}\right)\,P_{n-1}''(x)\)
\(P_{0}(x) = 1\)
Technical details
Node id
n-9f4396728047edfb · revision 2 · JSON
Definition source
derived:basis_map_A007318
derived:shift_x_plus_one (equal by e-9a46395478446a6a)
Fingerprint
f6-c6734442abd299d3

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:     11,     11,      1;
  3:     36,     54,     20,      1;
  4:    149,    298,    178,     29,      1;
  5:    550,   1375,   1172,    383,     38,      1;
  6:   2143,   6429,   7051,   3387,    669,     47,     1;
  7:   8136,  28476,  38360,  24710,   7672,   1036,    56,    1;
  8:  31273, 125092, 199556, 160846,  68446,  14756,  1484,   65,  1;
  9: 119498, 537741, 992056, 962738, 524412, 158914, 25368, 2013, 74, 1;
%F Formula
The row polynomials satisfy P(n,x) = (7+7*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[(7 + 7*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] = (7 + 7*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-c5fd3da4c5a13f73
  • 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-03aefd7a03322503, e-c5fd3da4c5a13f73
  • 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-03aefd7a03322503, e-c5fd3da4c5a13f73
  • 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-03aefd7a03322503, e-c5fd3da4c5a13f73
  • 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-03aefd7a03322503

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