basis-map coefficients of A112227 → x ↦ x+1 → θ+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
11438
2169420
3181816548
41103040256112
5112458075367256
611463140175126498576
7116842243503361966491280
811810833663075658828881102816
9120135480105015121470960405100116144
10122165660165027723234264014855501211213312
111241988802475475264686336445522007261441328672
12126234114435757722120121372811583715031469361691461440
13128273145650051201221021274562702720020110114368118319615131072
1413031518206825180183503551480579155005033033163805915147022516278528
15132360224091002620856056915201158301144008808852416236607840180025617589824
Technical details
Node id
n-6e0156c26c94d278 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-e99c3824c4864868

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1,  4,   3;
   2: 1,  6,   9,   4;
   3: 1,  8,  18,  16,    5;
   4: 1, 10,  30,  40,   25,    6;
   5: 1, 12,  45,  80,   75,   36,    7;
   6: 1, 14,  63, 140,  175,  126,   49,    8;
   7: 1, 16,  84, 224,  350,  336,  196,   64,    9;
   8: 1, 18, 108, 336,  630,  756,  588,  288,   81,  10;
   9: 1, 20, 135, 480, 1050, 1512, 1470,  960,  405, 100,  11;
  10: 1, 22, 165, 660, 1650, 2772, 3234, 2640, 1485, 550, 121, 12;
%F Formula
The row polynomials satisfy (1+(n+1)*x)*P(n,x) = (1+(n+3)*x+(n+2)*x^2)*P(n-1,x) for n >= 2, with P(1,x) = 1 + 4*x + 3*x^2.
%t Mathematica
P[1, x_] := 1 + 4*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((1 + (n + 3)*x + (n + 2)*x^2)*P[n - 1, x])/(1 + (n + 1)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1 + 4*x + 3*x^2; for(n = 2, N, my(i = n); v[i] = ((1 + (n + 3)*x + (n + 2)*x^2)*v[i - 1])/(1 + (n + 1)*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

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.