A119308 → basis A013611

nonnegative coefficients

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

Recurrence

\(\left(3 + n\right)\,P_{n}(x) = \left(-32\,x^{2} + 16\,n x^{2}\right)\,P_{n-3}(x) + \left(2 + 4\,x - 4\,n - 8\,n x - 16\,n x^{2}\right)\,P_{n-2}(x) + \left(7 + 12\,x + 5\,n + 8\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 4\,x\)
\(P_{2}(x) = 9 + 28\,x + 16\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1347
29281653
32814019264424
490624140811522563530
529726408400115206400102430281
6100110868448808800083200337924096265837
7343244044224224576576788480551936172032163842377108
811934176800107161634245126196736633651234406408519686553621576254
941990705432496454419009536430510085870592046964736204472324128768262144198281310
101492262803640224808001004659202741760004708515845057740803268608001169817601966080010485761841253186
11534888111137841000524805116320001637222400340542259246324776964044226560216268800064880640092274688419430417250645792
12193154043979680439321344253132774493048806402279013580837721604096419128934403044199628813725859840350643814442781900816777216162864964788
1370204051738386001908361520122382374405085667558414359531929628094736384038140733030435416394956821794704588884119912448185388236801962934272671088641547933921709
14256628256866231408217452880580661827202693212121608622758144001951206985728314220345753635784981872642826901389312149571502080050038466150496183779328892547891226843545614798880343965
Technical details
Node id
n-8f99a549bab56bfb · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-debc431b0cc42a35

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:     1;
  1:     3,      4;
  2:     9,     28,      16;
  3:    28,    140,     192,       64;
  4:    90,    624,    1408,     1152,      256;
  5:   297,   2640,    8400,    11520,     6400,     1024;
  6:  1001,  10868,   44880,    88000,    83200,    33792,     4096;
  7:  3432,  44044,  224224,   576576,   788480,   551936,   172032,    16384;
  8: 11934, 176800, 1071616,  3424512,  6196736,  6336512,  3440640,   851968,   65536;
  9: 41990, 705432, 4964544, 19009536, 43051008, 58705920, 46964736, 20447232, 4128768, 262144;
%F Formula
The row polynomials satisfy (n+3)*P(n,x) = (16*n-32)*x^2*P(n-3,x) - (4*n-2+(8*n-4)*x+16*n*x^2)*P(n-2,x) + (5*n+7+(8*n+12)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3 + 4*x, P(2,x) = 9 + 28*x + 16*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[2, x_] := 9 + 28*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((16*n - 32)*x^2*P[n - 3, x] - (4*n - 2 + (8*n - 4)*x + 16*n*x^2)*P[n - 2, x] + (5*n + 7 + (8*n + 12)*x)*P[n - 1, x])/(n + 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 4*x; v[3] = 9 + 28*x + 16*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((16*n - 32)*x^2*v[i - 3] - (4*n - 2 + (8*n - 4)*x + 16*n*x^2)*v[i - 2] + (5*n + 7 + (8*n + 12)*x)*v[i - 1])/(n + 3)); 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. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.