A391533 → x ↦ x+1 → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
01616436
14880448180
214433629211216900
343212961548920272324500
4129647527236585626566406422500
538881684831212320401968072321472128112500
6116645832012733215854412312061056188803328256562500
7349921982884986367302966864484294081787524774474245122812500
Technical details
Node id
n-b438a1032ada5daf · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-99f5d32b38d6538a

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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:     16,      16,       4;
  1:     48,      80,      44,        8;
  2:    144,     336,     292,      112,       16;
  3:    432,    1296,    1548,      920,      272,       32;
  4:   1296,    4752,    7236,     5856,     2656,      640,      64;
  5:   3888,   16848,   31212,    32040,    19680,     7232,    1472,     128;
  6:  11664,   58320,  127332,   158544,   123120,    61056,   18880,    3328,     256;
  7:  34992,  198288,  498636,   730296,   686448,   429408,  178752,   47744,    7424,    512;
  8: 104976,  664848, 1892484,  3188160,  3519936,  2661120, 1395072,  500736,  117760,  16384,  1024;
  9: 314928, 2204496, 7007148, 13349448, 16936128, 15023232, 9507456, 4292352, 1354752, 284672, 35840, 2048;
%F Formula
The row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) for n >= 1, with P(0,x) = 16 + 16*x + 4*x^2.
%t Mathematica
P[0, x_] := 16 + 16*x + 4*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + 2*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] = 16 + 16*x + 4*x^2; for(n = 1, N, my(i = n + 1); v[i] = (3 + 2*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.