A136394 → basis A007318

nonnegative coefficients

Proved for all n all roots real, in (−∞, −1]coefficients of one sign Hadamard kernel interlacing (weak)

Recurrence

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

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

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

Rows ?

n	x⁰	x¹	x²	x³	P_n(1)
0	1				1
1	1				1
2	2	1			3
3	6	5			11
4	24	26	3		53
5	120	154	35		309
6	720	1044	340	15	2119
7	5040	8028	3304	315	16687

All 15 rows

Technical details

Node id: n-5f40aeb2fcfc43d2 · revision 0 · JSON
Definition source: derived:shift_x_plus_one
Fingerprint: f6-adb63b75c11d63d7

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:      1;
  2:      2,      1;
  3:      6,      5;
  4:     24,     26,      3;
  5:    120,    154,     35;
  6:    720,   1044,    340,    15;
  7:   5040,   8028,   3304,   315;
  8:  40320,  69264,  33740,  4900,  105;
  9: 362880, 663696, 367884, 70532, 3465;

%F Formula

The row polynomials satisfy P(n,x) = (n-1)*x*P(n-2,x) + n*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.

%t Mathematica

P[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n - 1)*x*P[n - 2, x] + n*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; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (n - 1)*x*v[i - 2] + n*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 (−∞, -1]
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 Geometric basis map (elementary), Affine, reversal and Möbius substitutions (elementary)
Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary), Affine, reversal and Möbius substitutions (elementary)
Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
by Geometric basis map (elementary)
Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
by Geometric basis map (elementary)

Proof chains ? JSON

Geometric basis map (elementary) polytool ? step ›
- from Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).?
  - Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).?
  - ↑ Liu–Wang theorem for three-term recurrences (above)

Related ?

Same fingerprint ?

References

[LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003