A086915 → x ↦ x+1

nonnegative coefficients

Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel

Recurrence

\(\left(2\right)\,P_{n}(x) = \left(8 + 4\,x\right)\,P_{n-1}(x) + \left(6 + 4\,x\right)\,P_{n-1}'(x) + \left(1 + x\right)\,P_{n-1}''(x)\)
\(P_{0}(x) = 2\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
18412
24440892
330438414416848
4251239682112448329072
52406444960304009280128064110048
62615365585284521601772803552034561281488608
73173888757120070748163351040869120123648896025622172928
8424839681113518081171681286454067220357120377036840140822528512360096512
96211594241766877696205667942412838748164736471041072189441492377612349445529610246325672448
1098419502083009196544038235571200265499443201115584512029667778565066342405498880036403201331202048119407452672
11167879268352547534524416751602903040572443576320268738990080817202749441645116211221971558401912627201036288031539240962408769800192
1230657235496961059951673344015589649129472128821461401606659529338880227059045171252429504512082769854464888662016063438848028655616737280819251683770652672
135965109352857621750252982681634045915621785630257819227750417030783131648064147228434432166550608773123023389704192384528089088339195084802021933056773160961703936163841174745030750208
14123157111981260847152660363755527811463604625408741371348325171245023569843732481851785053454336532524584976384108947699367936159652572119041671182729216123281686528622916403220425932838993923276828185394725220352
Technical details
Node id
n-227b620650ca6bf3 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-7b312ef315523524

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         2;
  1:         8,          4;
  2:        44,         40,          8;
  3:       304,        384,        144,         16;
  4:      2512,       3968,       2112,        448,        32;
  5:     24064,      44960,      30400,       9280,      1280,        64;
  6:    261536,     558528,     452160,     177280,     35520,      3456,      128;
  7:   3173888,    7571200,    7074816,    3351040,    869120,    123648,     8960,     256;
  8:  42483968,  111351808,  117168128,   64540672,  20357120,   3770368,   401408,   22528,   512;
  9: 621159424, 1766877696, 2056679424, 1283874816, 473647104, 107218944, 14923776, 1234944, 55296, 1024;
%F Formula
The row polynomials satisfy 2*P(n,x) = (8+4*x)*P(n-1,x) + (6+4*x)*d/dx P(n-1,x) + (1+x)*d^2/dx^2 P(n-1,x) for n >= 1, with P(0,x) = 2.
%t Mathematica
P[0, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((8 + 4*x)*P[n - 1, x] + (6 + 4*x)*D[P[n - 1, x], x] + (1 + x)*D[P[n - 1, x], {x, 2}])/(2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; for(n = 1, N, my(i = n + 1); v[i] = ((8 + 4*x)*v[i - 1] + (6 + 4*x)*deriv(v[i - 1], x) + (1 + x)*deriv(deriv(v[i - 1], x), x))/(2)); 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)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.