A034870 → D → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
00
1426
23248244108
31924804802406061458
410243584537644802240672112817496
5512023040460805376040320201606720144018010196830
62457613516833792050688050688035481617740863360158402640264122125764
71146887454722236416410009651251204612608307507215375365765761601603203243683641422320522
Technical details
Node id
n-91fbe90ea8777148 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-177c65847e3c5511

Observed on the stored rows ?

  • Degrees: -1, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27 (affine: slope 2, 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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:       0;
  1:       4,        2;
  2:      32,       48,       24,         4;
  3:     192,      480,      480,       240,        60,         6;
  4:    1024,     3584,     5376,      4480,      2240,       672,       112,         8;
  5:    5120,    23040,    46080,     53760,     40320,     20160,      6720,      1440,       180,        10;
  6:   24576,   135168,   337920,    506880,    506880,    354816,    177408,     63360,     15840,      2640,      264,       12;
  7:  114688,   745472,  2236416,   4100096,   5125120,   4612608,   3075072,   1537536,    576576,    160160,    32032,     4368,     364,     14;
  8:  524288,  3932160, 13762560,  29818880,  44728320,  49201152,  41000960,  26357760,  13178880,   5125120,  1537536,   349440,   58240,   6720,   480,   16;
  9: 2359296, 20054016, 80216064, 200540160, 350945280, 456228864, 456228864, 358465536, 224040960, 112020480, 44808192, 14257152, 3564288, 685440, 97920, 9792, 612, 18;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (4*n+4*n*x+n*x^2)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4 + 2*x.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 4 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((4*n + 4*n*x + n*x^2)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 4 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n + 4*n*x + n*x^2)*v[i - 1])/(n - 1)); 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

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.