A159854 → basis A008277

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
01315
12107120
24323812187
3810018498181409
4163088366742062512066
53294036524206191038133111155
6642852155482468215666457764542164077
71288620650441389581186784770597371023521389946
8256259882687967598348510264526131256011894415436312504665
9512782201101172406796658659904019317145742129609734374223675116923381
1010242351724482908214410023926390634001209156786854122294639837589703136881119928232
11204870654018166804111687918257024438277272369159430689527793311052066412885079660242801021888980293
124096212166873373756576606394165383454621979310211552717881634444668157985971246942412447731152242570811716876320041
13819263691002956166922956405726104996136701703935169314619674069726271989322143043784296226225406701344268772321547463133155382419676
14163841911549211888358681507764532265954087746129775075521133996744245799841531062940576367369401532201078426778111616414767703334409995911501463539664643

Computed in your browser ?

Technical details
Node id
n-9a6b0e2632270c41 · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-c748c34fca57e6cb

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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,     3,       1;
  1:   2,    10,       7,       1;
  2:   4,    32,      38,      12,       1;
  3:   8,   100,     184,      98,      18,       1;
  4:  16,   308,     836,     674,     206,      25,       1;
  5:  32,   940,    3652,    4206,    1910,     381,      33,      1;
  6:  64,  2852,   15548,   24682,   15666,    4577,     645,     42,     1;
  7: 128,  8620,   65044,  138958,  118678,   47705,    9737,   1023,    52,    1;
  8: 256, 25988,  268796,  759834,  851026,  452613,  125601,  18944,  1543,   63,  1;
  9: 512, 78220, 1101172, 4067966, 5865990, 4019317, 1457421, 296097, 34374, 2236, 75, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1 + 3*x + x^2.
%t Mathematica
P[0, x_] := 1 + 3*x + x^2;
P[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1 + 3*x + x^2; for(n = 1, N, my(i = n + 1); v[i] = (2 + x)*v[i - 1] + x*deriv(v[i - 1], x)); 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-94a89e959b0863ff
  • 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-94a89e959b0863ff
  • 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-94a89e959b0863ff

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. [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