A124848 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1549
219281057
3631329020305
4192516510220351473
5552180023101460455566633
6152058089120754034658408428377
740481769632760333202012572241428120116721
810496515841097601321609856046648136922280165465345
926624145152348480483840428400250992973562412034652201808649
106630439680010598401664640170352011874245712001873204009550602866882489
11162560105881631116805448960632016051004802923536119064033775563580715036425725681
1239321627678728870400171212802217600020313216134977926557760231264057750096954982845594694913
13940032710860824660480519833607431424076108032574654083239808013642200423852094465814305213195560343960425
1422241281797734467092480153287680239599360271118848229092864146889600718317602666664073993921488396205205173606801234891737

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(\left(n\right)\,P_{n}(x) = \left(2 + x - 2\,n - n x\right)\,P_{n-2}(x) + \left(2 + 3\,x + 3\,n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 4\,x\)
Technical details
Node id
n-60da2299a7c8ee9b · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-17a210f1346c4343)
Fingerprint
f6-b7ef7f83c60f9896

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:     1;
  1:     5,      4;
  2:    19,     28,     10;
  3:    63,    132,     90,     20;
  4:   192,    516,    510,    220,     35;
  5:   552,   1800,   2310,   1460,    455,     56;
  6:  1520,   5808,   9120,   7540,   3465,    840,    84;
  7:  4048,  17696,  32760,  33320,  20125,   7224,  1428,   120;
  8: 10496,  51584, 109760, 132160,  98560,  46648, 13692,  2280,  165;
  9: 26624, 145152, 348480, 483840, 428400, 250992, 97356, 24120, 3465, 220;
%F Formula
The row polynomials satisfy n*P(n,x) = (n+4+4*x)*P(n-1,x) + (2+3*x+x^2)*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[Together[((n + 4 + 4*x)*P[n - 1, x] + (2 + 3*x + x^2)*D[P[n - 1, x], x])/(n)]];
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] = ((n + 4 + 4*x)*v[i - 1] + (2 + 3*x + x^2)*deriv(v[i - 1], x))/(n)); 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. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.