A299989 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
11438
2182224964
31125713617110827512
41161084008861200972432814096
512017588028105944843079204725162024332768
6124258164068551982440636594726169544280208985832729262144
712835727441418952164140497281488421491469476383103222264867512041221872097152
Technical details
Node id
n-45c3e3fbc36932e1 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-45b1586921223be0

Observed on the stored rows ?

  • Degrees: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28 (affine: slope 2, 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: 1,  4,   3;
  2: 1,  8,  22,   24,     9;
  3: 1, 12,  57,  136,   171,    108,     27;
  4: 1, 16, 108,  400,   886,   1200,    972,     432,      81;
  5: 1, 20, 175,  880,  2810,   5944,   8430,    7920,    4725,     1620,      243;
  6: 1, 24, 258, 1640,  6855,  19824,  40636,   59472,   61695,    44280,    20898,     5832,      729;
  7: 1, 28, 357, 2744, 14189,  52164, 140497,  281488,  421491,   469476,   383103,   222264,    86751,    20412,     2187;
  8: 1, 32, 472, 4256, 26236, 117152, 391720,  999968, 1968934,  2999904,  3525480,  3163104,  2125116,  1034208,   344088,   69984,    6561;
  9: 1, 36, 603, 6240, 44676, 234864, 939036, 2918304, 7143966, 13875544, 21431898, 26264736, 25353972, 19023984, 10856268, 4548960, 1318761, 236196, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (1+4*x+3*x^2)*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[(1 + 4*x + 3*x^2)*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] = (1 + 4*x + 3*x^2)*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.