basis-map coefficients of A297191, shifted → D → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
00
1246
24244832108
36602404804801921458
481126722240448053763584102417496
5101801440672020160403205376046080230405120196830
61226426401584063360177408354816506880506880337920135168245762125764
71436443683203216016057657615375363075072461260851251204100096223641674547211468822320522
Technical details
Node id
n-0936e707d9d749c8 · revision 0 · JSON
Definition source
derived:basis_map_A013609
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:  2,   4;
  2:  4,  24,   48,    32;
  3:  6,  60,  240,   480,    480,     192;
  4:  8, 112,  672,  2240,   4480,    5376,     3584,     1024;
  5: 10, 180, 1440,  6720,  20160,   40320,    53760,    46080,     23040,      5120;
  6: 12, 264, 2640, 15840,  63360,  177408,   354816,   506880,    506880,    337920,    135168,     24576;
  7: 14, 364, 4368, 32032, 160160,  576576,  1537536,  3075072,   4612608,   5125120,   4100096,   2236416,    745472,    114688;
  8: 16, 480, 6720, 58240, 349440, 1537536,  5125120, 13178880,  26357760,  41000960,  49201152,  44728320,  29818880,  13762560,   3932160,   524288;
  9: 18, 612, 9792, 97920, 685440, 3564288, 14257152, 44808192, 112020480, 224040960, 358465536, 456228864, 456228864, 350945280, 200540160, 80216064, 20054016, 2359296;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n+4*n*x+4*n*x^2)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2 + 4*x.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((n + 4*n*x + 4*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] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((n + 4*n*x + 4*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.