A111006 → basis A013610

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1134
23151836
35399981224
4111114146754051616
521267134133214050194410944
6436514068134192462423814947776096
7851503112954673711493916791313486545927523264
817134473018614993146178190274510935007501412230743614976
934177317740944914516637404078998661713368474974100625108256524925184
10683171871935361283931555579016381116333218614616538341682033221433755255361172000256
1113653776747256335290891747404960222447147384117256091139309561102247887702118334196255091681186504704
12273182383113376694111475247009920696431559212733412379010491876583781201148450214469366966271003801238257538186023936
13546117839526782292446359315166650667384774822070569775394924405984068643613227881418127350978308314925886329971716960105977156474189824
141092338412362469726226591542490170020997071107747764615216837222754624888266074803273200903052300237890021091847158480017172585464752917611090389617238016
Technical details
Node id
n-53f3ce2888a3b03b · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-ac4ba740a33f010b

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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   1,    3;
  2:   3,   15,    18;
  3:   5,   39,    99,     81;
  4:  11,  111,   414,    675,     405;
  5:  21,  267,  1341,   3321,    4050,    1944;
  6:  43,  651,  4068,  13419,   24624,   23814,    9477;
  7:  85, 1503, 11295,  46737,  114939,  167913,  134865,   45927;
  8: 171, 3447, 30186, 149931,  461781,  902745, 1093500,  750141,  223074;
  9: 341, 7731, 77409, 449145, 1663740, 4078998, 6617133, 6847497, 4100625, 1082565;
%F Formula
The row polynomials satisfy P(n,x) = (2+9*x+9*x^2)*P(n-2,x) + (1+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[(2 + 9*x + 9*x^2)*P[n - 2, x] + (1 + 3*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; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 9*x + 9*x^2)*v[i - 2] + (1 + 3*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

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