A038328 → x ↦ x+1 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
0456196256
18168117627444096
2164484704219523841665536
3321120156801097603841605378241048576
46426884704043904023049606453888752953616777216
5128627213171215366401075648045177216105413504105413504268435456
625614336351232491724843025920240945152843308032168661606414757890564294967296
751232256903168147517441548933121084253184505984819215179544576265642030082066104678468719476736
Technical details
Node id
n-eccac710ef17edb6 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-d2d514e02d66ef29

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:    4,     56,     196;
  1:    8,    168,    1176,      2744;
  2:   16,    448,    4704,     21952,      38416;
  3:   32,   1120,   15680,    109760,     384160,      537824;
  4:   64,   2688,   47040,    439040,    2304960,     6453888,      7529536;
  5:  128,   6272,  131712,   1536640,   10756480,    45177216,    105413504,    105413504;
  6:  256,  14336,  351232,   4917248,   43025920,   240945152,    843308032,   1686616064,    1475789056;
  7:  512,  32256,  903168,  14751744,  154893312,  1084253184,   5059848192,  15179544576,   26564203008,   20661046784;
  8: 1024,  71680, 2257920,  42147840,  516311040,  4337012736,  25299240960, 101196963840,  265642030080,  413220935680,  289254654976;
  9: 2048, 157696, 5519360, 115906560, 1622691840, 15902380032, 111316660224, 556583301120, 1948041553920, 4545430292480, 6363602409472, 4049565169664;
%F Formula
The row polynomials satisfy P(n,x) = (2+14*x)*P(n-1,x) for n >= 1, with P(0,x) = 4 + 56*x + 196*x^2.
%t Mathematica
P[0, x_] := 4 + 56*x + 196*x^2;
P[n_, x_] := P[n, x] = Expand[(2 + 14*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] = 4 + 56*x + 196*x^2; for(n = 1, N, my(i = n + 1); v[i] = (2 + 14*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.