A269944 → basis A013609 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

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

\(P_{0}(x) = 1\)

Rows ?

n	x⁰	x¹	x²	x³	x⁴	x⁵	x⁶	x⁷	P_n(1)
0	1								1
1	2	1							3
2	4	6	2						12
3	8	32	34	10					84
4	16	144	388	360	100				1008
5	32	560	3224	7316	6320	1700			19152
6	64	1952	21008	98456	202856	167720	44200		536256
7	128	6272	114240	974208	4048584	7841112	6294040	1635400	20913984

All 15 rows

Technical details

Node id: n-702478000e7a23c3 · revision 0 · JSON
Definition source: derived:reversal
Fingerprint: f6-7d88dc66b737aeee

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:   2,     1;
  2:   4,     6,       2;
  3:   8,    32,      34,       10;
  4:  16,   144,     388,      360,       100;
  5:  32,   560,    3224,     7316,      6320,       1700;
  6:  64,  1952,   21008,    98456,    202856,     167720,       44200;
  7: 128,  6272,  114240,   974208,   4048584,    7841112,     6294040,     1635400;
  8: 256, 18944,  542080,  7660416,  56807568,  218111424,   404643680,   317972800,    81770000;
  9: 512, 54528, 2315520, 50556032, 611542176, 4128714768, 14986529920, 26937784800, 20831772000, 5315050000;

%F Formula

The row polynomials satisfy P(n,x) = (2+(n^2-2*n+2)*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^2 - 2*n + 2)*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^2 - 2*n + 2)*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

Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
by Affine, reversal and Möbius substitutions (elementary)
Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Affine, reversal and Möbius substitutions (elementary)
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from basis_map_A013609 of Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k >…?
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k)…?
    
    Parent-row provers of polytool polytool ? step › direct check
    
    Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
    
    Parent-row provers of polytool polytool ? step › direct check
  - Geometric basis map (elementary) polytool ? step ›
    
    from Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k)…?
    
    ↑ Parent-row provers of polytool (above)
    
    ↑ Iterated real-rootedness preservers (above)
    
    ↑ Parent-row provers of polytool (above)

Related ?

Same fingerprint ?

A269944 → basis A013609

References

[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
[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
[SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.