A225466 → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
1336
2624939
31213814427321
4247261566729813126
54837021470612717332124334737
696186541287541840058464514094729430977
7192935581085994241031717370454935335686221875879688
838446836689686262977146931549581136011962617839220887656187204909
97682342982731541063543920375310085413258690759316036812933918833247196831393714725
1015361171721459226179441177747258497295685713279989828408145855769612186046617630705485904923833222428
113072585906784773245994470723073571313154637651467494853217821469139421792551769330300423027044442011101212177147433561066359
12614429296260638361739986532115118909197963341478128886876417522004542283843735872764869151255765287177519008701166572044395037815314418349720206313
1312288146483146230777280770659683515279572931121316366155046590154127487569086021162293870044351661402681920699685724210919058600801848823484671387061011594323169535450812902
14245767324194174246657695603466575185230645428262038875125102372567211114211402779425047016738608360072162284630743243424650940478784658044695198494426402203991991787723948148554647829693616415568901803
154915236621044598197545882307947397267684051976195394099943685186881225425147892587673586642744618919633055680071796162244045454020341619618205603252712389987063290581627351220847999962797949453910316549072741434890780795530963634613

Computed in your browser ?

Technical details
Node id
n-c9945ec6eb94c8a9 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-0cf4273626c53359

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:    3,        3;
   2:    6,       24,         9;
   3:   12,      138,       144,         27;
   4:   24,      726,      1566,        729,         81;
   5:   48,     3702,     14706,      12717,       3321,        243;
   6:   96,    18654,    128754,     184005,      84645,      14094,        729;
   7:  192,    93558,   1085994,    2410317,    1737045,     493533,      56862,      2187;
   8:  384,   468366,   8968626,   29771469,   31549581,   13601196,    2617839,    220887,     6561;
   9:  768,  2342982,  73154106,  354392037,  531008541,  325869075,   93160368,  12933918,   833247,   19683;
  10: 1536, 11717214, 592261794, 4117774725, 8497295685, 7132799898, 2840814585, 576961218, 60466176, 3070548, 59049;
%F Formula
The row polynomials satisfy P(n,x) = (2+3*x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 2, with P(1,x) = 3 + 3*x.
%t Mathematica
P[1, x_] := 3 + 3*x;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x)*P[n - 1, x] + 3*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 3 + 3*x; for(n = 2, N, my(i = n); v[i] = (2 + 3*x)*v[i - 1] + 3*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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-1a132a11ecb2f34a

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. [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
  2. [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
  3. [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.