A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).

A049403 (tail) ↗ nonnegative coefficients

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

Recurrence from A049403

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
00314
1036110
2001510126
300154515176
4000105105211232
5000105420210281764
6000094512603783612620
70000945472531506304519496
8000001039517325693099055135696
900000103956237051975138601485661140152
10000000135135270270135135257402145781568504
110000001351359459459459453153154504530039112390480
120000000202702547297252837835675675750754095105110349536
13000000020270251621620018918900756756013513501201205460120146206736
140000000034459425918918006432426018378360255255018564071401361211799312
Technical details
Node id
n-47e3a1a59edf16da · revision 0 · JSON
Definition source
oeis_catalog:A049403
Fingerprint
f6-eccca8d515312e3b

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 2)
  • 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 ?

Row sums ? A000085

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 0, 3,  1;
  1: 0, 3,  6,   1;
  2: 0, 0, 15,  10,   1;
  3: 0, 0, 15,  45,  15,     1;
  4: 0, 0,  0, 105, 105,    21,     1;
  5: 0, 0,  0, 105, 420,   210,    28,     1;
  6: 0, 0,  0,   0, 945,  1260,   378,    36,     1;
  7: 0, 0,  0,   0, 945,  4725,  3150,   630,    45,    1;
  8: 0, 0,  0,   0,   0, 10395, 17325,  6930,   990,   55,  1;
  9: 0, 0,  0,   0,   0, 10395, 62370, 51975, 13860, 1485, 66, 1;
%F Formula
The row polynomials satisfy P(n,x) = x*P(n-1,x) + (n+2)*x*P(n-2,x) for n >= 2, with P(0,x) = 3*x + x^2, P(1,x) = 3*x + 6*x^2 + x^3.
%t Mathematica
P[0, x_] := 3*x + x^2;
P[1, x_] := 3*x + 6*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[x*P[n - 1, x] + (n + 2)*x*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 3*x + x^2; v[2] = 3*x + 6*x^2 + x^3; for(n = 2, N, my(i = n + 1); v[i] = x*v[i - 1] + (n + 2)*x*v[i - 2]); 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

  • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check

Same fingerprint ?

References

  1. [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