A274496 → basis A013610 → x ↦ x+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
210616
3201232
410012036256
520024072512
61000180010802164096
72000360021604328192
81000024000216008640129665536
9200004800043200172802592131072
101000003000003600002160006480077761048576
11200000600000720000432000129600155522097152
12100000036000005400000432000019440004665604665616777216
132000000720000010800000864000038880009331209331233554432
141000000042000000756000007560000045360000163296003265920279936268435456

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(P_{n}(x) = \left(10 + 6\,x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2\)
Technical details
Node id
n-d7a8290cc3936400 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-1396bd047934bc5c)
Fingerprint
f6-aee9d583da3df3c2

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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:     2;
  2:    10,     6;
  3:    20,    12;
  4:   100,   120,    36;
  5:   200,   240,    72;
  6:  1000,  1800,  1080,   216;
  7:  2000,  3600,  2160,   432;
  8: 10000, 24000, 21600,  8640, 1296;
  9: 20000, 48000, 43200, 17280, 2592;
%F Formula
The row polynomials satisfy P(n,x) = (3*n-1+(3*n-3)*x)*P(n-1,x) - (10+16*x+6*x^2)*d/dx 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[(3*n - 1 + (3*n - 3)*x)*P[n - 1, x] - (10 + 16*x + 6*x^2)*D[P[n - 1, x], 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] = (3*n - 1 + (3*n - 3)*x)*v[i - 1] - (10 + 16*x + 6*x^2)*deriv(v[i - 1], x)); 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.