A145324 → basis A007318 → basis A013610

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
15611
2358754176
3315120315306483696
43465179583487530078972096096
54504529582477661910187646677641749602978976
66756755383305178615893159045931410504166474443674160107243136
71148647510773238543284633396571593912921495841036858644461999376881798404396968576
Technical details
Node id
n-5330dd6ad63ae41a · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-688936af34ca8e0b

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:          5,           6;
  2:         35,          87,           54;
  3:        315,        1203,         1530,          648;
  4:       3465,       17958,        34875,        30078,          9720;
  5:      45045,      295824,       776619,      1018764,        667764,        174960;
  6:     675675,     5383305,     17861589,     31590459,      31410504,      16647444,       3674160;
  7:   11486475,   107732385,    432846333,    965715939,    1292149584,    1036858644,     461999376,      88179840;
  8:  218243025,  2357050140,  11132854722,  30035453832,   50625172449,   54588353004,   36773171532,   14149400112,   2380855680;
  9: 4583103525, 56045343690, 304501453362, 964730172132, 1964192236389, 2665110586554, 2409887192292, 1400332548312, 474479972640, 71425670400;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+3+(3*n+3)*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 + 3 + (3*n + 3)*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 + 3 + (3*n + 3)*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

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.