A008556: Triangle of coefficients of Legendre polynomials 2^n P_n (x).

A008556 ↗ nonnegative coefficients

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

Recurrence from A008556

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
2628
3201232
470606136
525228060592
69241260420202624
734325544252028011776
812870240241386025207053344
94862010296072072184801260243392
10184756437580360360120120138602521116928
117054321847560175032072072012012055445149696
1227041567759752831402040840809009007207292423835904
1310400600324498723879876022170720612612072072024024110690816
14401166001352078001784742961163962803879876061261203603603432515483648

Other recurrences

Reversed rows · proved equal for all n (proof step)

\(\left(n\right)\,P_{n}(x) = \left(-2 - 2\,x + 4\,n + 2\,n x\right)\,P_{n-1}(x) + \left(-4\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Technical details
Node id
n-b2f14d9f44a39df2 · revision 1 · JSON
Definition source
oeis_catalog:A008556
derived:reversal (equal by e-5fb73cf2df09a656)
Fingerprint
f6-a866a9bf376c404a

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 ?

  • A008556 triangle 42 terms, 12 rows · tabf · nonn · catalog b-file?

Row sums ? A006139

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:     1;
  1:     2;
  2:     6,      2;
  3:    20,     12;
  4:    70,     60,     6;
  5:   252,    280,    60;
  6:   924,   1260,   420,    20;
  7:  3432,   5544,  2520,   280;
  8: 12870,  24024, 13860,  2520,   70;
  9: 48620, 102960, 72072, 18480, 1260;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n-2)*P(n-1,x) + (4*n-4)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 2)*P[n - 1, x] + (4*n - 4)*x*P[n - 2, x])/(n)]];
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] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 2)*v[i - 1] + (4*n - 4)*x*v[i - 2])/(n)); 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

A008556 triangle, offset 0, from P0
%e Example
Triangle begins:
  0:     1;
  1:     2;
  2:     6,      2;
  3:    20,     12;
  4:    70,     60,     6;
  5:   252,    280,    60;
  6:   924,   1260,   420,    20;
  7:  3432,   5544,  2520,   280;
  8: 12870,  24024, 13860,  2520,   70;
  9: 48620, 102960, 72072, 18480, 1260;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n-2)*P(n-1,x) + (4*n-4)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 2)*P[n - 1, x] + (4*n - 4)*x*P[n - 2, x])/(n)]];
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] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 2)*v[i - 1] + (4*n - 4)*x*v[i - 2])/(n)); 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

Used in 10

2 more

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