Real-rooted atlas

A286724: Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].

A286724 ↗ nonnegative coefficients

Proved for all n all roots real, in (−∞, 0)coefficients of one signHadamard kernelinterlacing (weak)

Recurrence from A286724

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2213
388117
44872181139
53847682883211473
638409600480080050119091
74608013824086400192001800721291793
8645120225792016934404704005880035289815129307
910321920412876803612672012042240188160015052862721281101817089
101857945608360755208360755203251404806096384060963843386881036816212250495523
1137158912001857945600020901888000928972800020321280002438553601693440069120016200200154780588561
12817496064004496228352005620285440002810142720007025356800098354995208196249604181760013068002420024211455367098923
13196199055360011771943321600161864220672008992456704000252912844800040466055168039341998080240869376094089600232320034848288141888448785857
145101175439360033157640355840049736460533760030394503659520094982823936000170969083084801899656478720135689748480636045696019631040039262084867233811298019439099059
15142832912302080099983038611456001624724377436160010831495849574400372332669829120074466533965824093083167457280759862591488041554985472015390735360384768384635980866248392143074477771208913

b-files: A025167 (row sums), A286724 ?

Technical details
Node id
n-24ab55cfc575f41e · revision 1 · JSON
Definition source
oeis_catalog:A286724
Fingerprint
f6-31dfc9d837f82561

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 -1)
  • 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 ?

  • A286724 triangle 66 terms, 11 rows · tabl · nonn · catalog b-file?

Row sums ? A025167

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:         1;
   2:         2,         1;
   3:         8,         8,         1;
   4:        48,        72,        18,         1;
   5:       384,       768,       288,        32,        1;
   6:      3840,      9600,      4800,       800,       50,       1;
   7:     46080,    138240,     86400,     19200,     1800,      72,      1;
   8:    645120,   2257920,   1693440,    470400,    58800,    3528,     98,     1;
   9:  10321920,  41287680,  36126720,  12042240,  1881600,  150528,   6272,   128,   1;
  10: 185794560, 836075520, 836075520, 325140480, 60963840, 6096384, 338688, 10368, 162, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (4+4*x)*d/dx P(n-1,x) + 4*x*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 1, x] + (4 + 4*x)*D[P[n - 1, x], x] + 4*x*D[P[n - 1, x], {x, 2}]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (2 + x)*v[i - 1] + (4 + 4*x)*deriv(v[i - 1], x) + 4*x*deriv(deriv(v[i - 1], x), 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)

polytool c48629374597

A286724 triangle, offset 0, from P1
%e Example
Triangle begins:
  0:         1;
  1:         2,         1;
  2:         8,         8,         1;
  3:        48,        72,        18,         1;
  4:       384,       768,       288,        32,        1;
  5:      3840,      9600,      4800,       800,       50,       1;
  6:     46080,    138240,     86400,     19200,     1800,      72,      1;
  7:    645120,   2257920,   1693440,    470400,    58800,    3528,     98,     1;
  8:  10321920,  41287680,  36126720,  12042240,  1881600,  150528,   6272,   128,   1;
  9: 185794560, 836075520, 836075520, 325140480, 60963840, 6096384, 338688, 10368, 162, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (4+4*x)*d/dx P(n-1,x) + 4*x*d^2/dx^2 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[(2 + x)*P[n - 1, x] + (4 + 4*x)*D[P[n - 1, x], x] + 4*x*D[P[n - 1, x], {x, 2}]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (2 + x)*v[i - 1] + (4 + 4*x)*deriv(v[i - 1], x) + 4*x*deriv(deriv(v[i - 1], x), x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

Used in 6

Same fingerprint ?

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.