A153656: Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.

A153656 ↗ palindromicγ-positivenonnegative coefficients

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

Recurrence from A153656

\(\left(-2 + n\right)\,P_{n}(x) = \left(-2 - 2\,x + n + n x\right)\,P_{n-1}(x) + \left(-966\,x + 483\,n x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 23 + 23\,x\)
\(P_{2}(x) = 2 + 1054\,x + 2\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1232346
22105421058
321216512165224334
4213133533412131332559682
52141016422240642224014101212872686
62150691277958027048247612779580150692296071778
72160371960543233852039763385203976196054321603726809650894
8217005268997969577346548137413443860957734654826899796170052156621970562
921797334662672190736700001782044310816178204431081619073670000346626721797323602305322926
1021894142894060321009341406426976363500699347820060126426976363500321009341404289406018941282853022427298
112199095159396048885898776156716599076409370891604936409370891604936401567165990764048885898776515939601990921905619515827854
12220877607623726965532371631225296996036405699040397178035652678029891076405699040397178031225296996036696553237166076237220877243829248864040642
1322184570399296946359687685490684142856011657627436357936492323732952290976492323732952290976116576274363579365490684142856094635968768703992962184521008072723872934766
14222813805047321240545937408864499875215626794352726871884246350772550701865218204890954341971660246350772550701865226794352726871884886449987521561240545937408050473222813223185672649077499618
Technical details
Node id
n-6e554ebca19f83a9 · revision 0 · JSON
Definition source
oeis_catalog:A153656
Fingerprint
f6-86de729c02373aa4

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

  • A153656 reversed triangle 45 terms, 9 rows · tabl · nonn · catalog b-file?
  • A153656 triangle 45 terms, 9 rows · tabl · nonn · catalog b-file?

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  2;
  1: 23,    23;
  2:  2,  1054,        2;
  3:  2, 12165,    12165,           2;
  4:  2, 13133,   533412,       13133,             2;
  5:  2, 14101,  6422240,     6422240,         14101,             2;
  6:  2, 15069, 12779580,   270482476,      12779580,         15069,           2;
  7:  2, 16037, 19605432,  3385203976,    3385203976,      19605432,       16037,        2;
  8:  2, 17005, 26899796,  9577346548,  137413443860,    9577346548,    26899796,    17005,     2;
  9:  2, 17973, 34662672, 19073670000, 1782044310816, 1782044310816, 19073670000, 34662672, 17973, 2;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) + (483*n-966)*x*P(n-2,x) for n >= 3, with P(0,x) = 2, P(1,x) = 23 + 23*x, P(2,x) = 2 + 1054*x + 2*x^2.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 23 + 23*x;
P[2, x_] := 2 + 1054*x + 2*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x] + (483*n - 966)*x*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 23 + 23*x; v[3] = 2 + 1054*x + 2*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1] + (483*n - 966)*x*v[i - 2])/(n - 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

A153656 triangle, offset 1, from P0
%e Example
Triangle begins:
   1:  2;
   2: 23,    23;
   3:  2,  1054,        2;
   4:  2, 12165,    12165,           2;
   5:  2, 13133,   533412,       13133,             2;
   6:  2, 14101,  6422240,     6422240,         14101,             2;
   7:  2, 15069, 12779580,   270482476,      12779580,         15069,           2;
   8:  2, 16037, 19605432,  3385203976,    3385203976,      19605432,       16037,        2;
   9:  2, 17005, 26899796,  9577346548,  137413443860,    9577346548,    26899796,    17005,     2;
  10:  2, 17973, 34662672, 19073670000, 1782044310816, 1782044310816, 19073670000, 34662672, 17973, 2;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) + (483*n-1449)*x*P(n-2,x) for n >= 4, with P(1,x) = 2, P(2,x) = 23 + 23*x, P(3,x) = 2 + 1054*x + 2*x^2.
%t Mathematica
P[1, x_] := 2;
P[2, x_] := 23 + 23*x;
P[3, x_] := 2 + 1054*x + 2*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x] + (483*n - 1449)*x*P[n - 2, x])/(n - 3)]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 2; v[2] = 23 + 23*x; v[3] = 2 + 1054*x + 2*x^2; for(n = 4, N, my(i = n); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1] + (483*n - 1449)*x*v[i - 2])/(n - 3)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

A153656 reversed triangle, offset 1, from P0
%e Example
Triangle begins:
   1:  2;
   2: 23,    23;
   3:  2,  1054,        2;
   4:  2, 12165,    12165,           2;
   5:  2, 13133,   533412,       13133,             2;
   6:  2, 14101,  6422240,     6422240,         14101,             2;
   7:  2, 15069, 12779580,   270482476,      12779580,         15069,           2;
   8:  2, 16037, 19605432,  3385203976,    3385203976,      19605432,       16037,        2;
   9:  2, 17005, 26899796,  9577346548,  137413443860,    9577346548,    26899796,    17005,     2;
  10:  2, 17973, 34662672, 19073670000, 1782044310816, 1782044310816, 19073670000, 34662672, 17973, 2;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) + (483*n-1449)*x*P(n-2,x) for n >= 4, with P(1,x) = 2, P(2,x) = 23 + 23*x, P(3,x) = 2 + 1054*x + 2*x^2.
%t Mathematica
P[1, x_] := 2;
P[2, x_] := 23 + 23*x;
P[3, x_] := 2 + 1054*x + 2*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x] + (483*n - 1449)*x*P[n - 2, x])/(n - 3)]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 2; v[2] = 23 + 23*x; v[3] = 2 + 1054*x + 2*x^2; for(n = 4, N, my(i = n); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1] + (483*n - 1449)*x*v[i - 2])/(n - 3)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

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