A028338 → x ↦ x+1 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1347
215321663
310528424064693
49452976329615362569009
51039536516481603008089601024135135
61351355162887721445836802368004915240962297295
7202702582848601364731211843776588672016844802580481638443648605
Technical details
Node id
n-3a1fea9eacf93d7c · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-e3ba37fff5d43b63

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         1;
  1:         3,          4;
  2:        15,         32,         16;
  3:       105,        284,        240,         64;
  4:       945,       2976,       3296,       1536,        256;
  5:     10395,      36516,      48160,      30080,       8960,       1024;
  6:    135135,     516288,     772144,     583680,     236800,      49152,      4096;
  7:   2027025,    8284860,   13647312,   11843776,    5886720,    1684480,    258048,    16384;
  8:  34459425,  148950720,  265143744,  255933440,  147449344,   52183040,  11124736,  1310720,   65536;
  9: 654729075, 2967901380, 5633534016, 5923310336, 3825271296, 1581275136, 420102144, 69402624, 6488064, 262144;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+1+4*x)*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*n + 1 + 4*x)*P[n - 1, x]];
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] = (2*n + 1 + 4*x)*v[i - 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. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.