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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
17613
24912036205
3343185414042163817
42401261603780013824129681481
51680735448687516057240012312077761949749
611764947091601875495619560960725112010264324665651466933
7823543619249743845991246015537363421504808148470481648002799361480981297
8576480180996592076789332001734643814414215987296506783692883999462462705664167961646029306193
94035360710564145766150759526320479734552800544774235040272805890112665267904008112545280468612864100776961533796729885
10282475249137576016600292781587467612897920977920197664086030401336246334438444974873278727966754611207444897920034264166406046617654464565942877
111977326743179018306729456453957718444340014919696056690146192561760613009595360448273566735164800660220215621128874746622720655705290240246097336323627970562050561006901305
121384128720123284243835280108336629505420088390967387120642343462148759089626822232183707136154414271842490884876479467532288884243193622272932465024409605583083894784174142586880217678233681503770541295385
13968890104073027782175818462072366506904148022747761623812680077950784654759016011330303197227094088249147620249536003315960570145766407789225245441868810993495810632192933545635596288462109122109441216821325824130606940163407419876418468293
146782230728493936698162626440395566305617279196581128239636741888025529608940404055760465991689090257890564226951668540926124821197695365863976960627365022708048768011379567591750758401285085324487444488974670404976640373394358005760841108694630478364164096149356248051991881157

Computed in your browser ?

Technical details
Node id
n-2083f3598b33e80c · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-13272150c77921c5

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:        7,           6;
  2:       49,         120,           36;
  3:      343,        1854,         1404,          216;
  4:     2401,       26160,        37800,        13824,         1296;
  5:    16807,      354486,       875160,       572400,       123120,         7776;
  6:   117649,     4709160,     18754956,     19560960,      7251120,      1026432,       46656;
  7:   823543,    61924974,    384599124,    601553736,    342150480,     81484704,     8164800,     279936;
  8:  5764801,   809965920,   7678933200,  17346438144,  14215987296,   5067836928,   839994624,   62705664,   1679616;
  9: 40353607, 10564145766, 150759526320, 479734552800, 544774235040, 272805890112, 66526790400, 8112545280, 468612864, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (7+6*x)*P(n-1,x) + 6*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(7 + 6*x)*P[n - 1, x] + 6*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; for(n = 1, N, my(i = n + 1); v[i] = (7 + 6*x)*v[i - 1] + 6*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-7bcf400b3d75a9d5
  • 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-7bcf400b3d75a9d5
  • 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-7bcf400b3d75a9d5

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