A274496 → basis A013611 → (θ+1)²

nonnegative coefficients

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

Recurrence

\(\left(4 + 7\,x + x^{2} - 6\,x^{3} + 10\,n x + 6\,n x^{2} - 3\,n x^{3} + 14\,n^{2} x^{2} + 11\,n^{2} x^{3} + n^{2} x^{4} + 6\,n^{3} x^{3} + 2\,n^{3} x^{4} + n^{4} x^{4}\right)\,P_{n}(x) = \left(8 - 50\,x - 110\,x^{2} - 116\,x^{3} - 40\,x^{4} - 16\,x^{5} + 84\,n x - 36\,n x^{2} - 138\,n x^{3} - 124\,n x^{4} - 32\,n x^{5} + 188\,n^{2} x^{2} + 126\,n^{2} x^{3} + 18\,n^{2} x^{4} - 4\,n^{2} x^{5} + 144\,n^{3} x^{3} + 112\,n^{3} x^{4} + 28\,n^{3} x^{5} + 42\,n^{4} x^{4} + 20\,n^{4} x^{5} + 4\,n^{5} x^{5}\right)\,P_{n-1}(x) + \left(-16\,x - 72\,x^{2} - 136\,x^{3} - 152\,x^{4} - 96\,x^{5} - 32\,x^{6} - 68\,n x^{2} - 276\,n x^{3} - 412\,n x^{4} - 312\,n x^{5} - 96\,n x^{6} - 80\,n^{2} x^{3} - 276\,n^{2} x^{4} - 284\,n^{2} x^{5} - 104\,n^{2} x^{6} - 32\,n^{3} x^{4} - 88\,n^{3} x^{5} - 48\,n^{3} x^{6} - 4\,n^{4} x^{5} - 8\,n^{4} x^{6}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
243236
386472
416256576848
53251211521696
66415366912819216704
71283072138241638433408
8256819255296131072102400297216
951216384110592262144204800594432
101024409603686401310720204800011796484948992
112048819207372802621440409600023592969897984
12409619660822118401048576024576000283115521284505678630912
138192393216442368020971520491520005662310425690112157261824
141638491750412386304734003202293760003963617283596615681342177281206337536
Technical details
Node id
n-8ecfb16735d608fb · revision 0 · JSON
Definition source
derived:theta_plus_one_squared
Fingerprint
f6-5367d60e6d4311ec

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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   2;
  2:   4,    32;
  3:   8,    64;
  4:  16,   256,    576;
  5:  32,   512,   1152;
  6:  64,  1536,   6912,   8192;
  7: 128,  3072,  13824,  16384;
  8: 256,  8192,  55296, 131072, 102400;
  9: 512, 16384, 110592, 262144, 204800;
%F Formula
The row polynomials satisfy (4+(10*n+7)*x+(14*n^2+6*n+1)*x^2+(6*n^3+11*n^2-3*n-6)*x^3+(n^4+2*n^3+n^2)*x^4)*P(n,x) = (8+(84*n-50)*x+(188*n^2-36*n-110)*x^2+(144*n^3+126*n^2-138*n-116)*x^3+(42*n^4+112*n^3+18*n^2-124*n-40)*x^4+(4*n^5+20*n^4+28*n^3-4*n^2-32*n-16)*x^5)*P(n-1,x) - (16*x+(68*n+72)*x^2+(80*n^2+276*n+136)*x^3+(32*n^3+276*n^2+412*n+152)*x^4+(4*n^4+88*n^3+284*n^2+312*n+96)*x^5+(8*n^4+48*n^3+104*n^2+96*n+32)*x^6)*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[Together[((8 + (84*n - 50)*x + (188*n^2 - 36*n - 110)*x^2 + (144*n^3 + 126*n^2 - 138*n - 116)*x^3 + (42*n^4 + 112*n^3 + 18*n^2 - 124*n - 40)*x^4 + (4*n^5 + 20*n^4 + 28*n^3 - 4*n^2 - 32*n - 16)*x^5)*P[n - 1, x] - (16*x + (68*n + 72)*x^2 + (80*n^2 + 276*n + 136)*x^3 + (32*n^3 + 276*n^2 + 412*n + 152)*x^4 + (4*n^4 + 88*n^3 + 284*n^2 + 312*n + 96)*x^5 + (8*n^4 + 48*n^3 + 104*n^2 + 96*n + 32)*x^6)*D[P[n - 1, x], x])/(4 + (10*n + 7)*x + (14*n^2 + 6*n + 1)*x^2 + (6*n^3 + 11*n^2 - 3*n - 6)*x^3 + (n^4 + 2*n^3 + n^2)*x^4)]];
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] = ((8 + (84*n - 50)*x + (188*n^2 - 36*n - 110)*x^2 + (144*n^3 + 126*n^2 - 138*n - 116)*x^3 + (42*n^4 + 112*n^3 + 18*n^2 - 124*n - 40)*x^4 + (4*n^5 + 20*n^4 + 28*n^3 - 4*n^2 - 32*n - 16)*x^5)*v[i - 1] - (16*x + (68*n + 72)*x^2 + (80*n^2 + 276*n + 136)*x^3 + (32*n^3 + 276*n^2 + 412*n + 152)*x^4 + (4*n^4 + 88*n^3 + 284*n^2 + 312*n + 96)*x^5 + (8*n^4 + 48*n^3 + 104*n^2 + 96*n + 32)*x^6)*deriv(v[i - 1], x))/(4 + (10*n + 7)*x + (14*n^2 + 6*n + 1)*x^2 + (6*n^3 + 11*n^2 - 3*n - 6)*x^3 + (n^4 + 2*n^3 + n^2)*x^4)); 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.