A035607 → basis A013609 → basis A013610

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
011
111
271219
3319672199
41456489364322161
5673393684247776259223401
631272259664008885605961615552253459
714527124992440496812160824256435456933122745199
8674896736802839536654134488801927091712307929655987229733121
931353735617921747166448282048821145608789990457760128212751363359232322038001
10145661518554364103818096334619424684039168918843264810228096451816704144446976201553923487978099
1167670719552374460038431222110624005279909184853599513694546517767079021568342641664096745881612093235237778122999
12314381294871001843397460184140733223203844584518472684200448969783217929126081561659324037120253554831366409414656725594112409173032881
131460537292464203168188867372408691354345626732941660857869931340890359841600010248781685768376144215044808270315521839381073924208445849643535646724431733435801
146785293031238306437210344714962452357932532817905763966404367501425728781362971251210376755547904102252637025287381005327360379207576166413125997486082742745743362612138803247999891653939
Technical details
Node id
n-42e9b771fcf14435 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-2ae3ed455d3e70cf

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (irregular)
  • 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:      7,      12;
  3:     31,      96,       72;
  4:    145,     648,      936,      432;
  5:    673,    3936,     8424,     7776,     2592;
  6:   3127,   22596,    64008,    88560,    59616,    15552;
  7:  14527,  124992,   440496,   812160,   824256,   435456,    93312;
  8:  67489,  673680,  2839536,  6541344,  8880192,  7091712,  3079296,   559872;
  9: 313537, 3561792, 17471664, 48282048, 82114560, 87899904, 57760128, 21275136, 3359232;
%F Formula
The row polynomials satisfy P(n,x) = (3+6*x)*P(n-2,x) + (4+6*x)*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[(3 + 6*x)*P[n - 2, x] + (4 + 6*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; for(n = 2, N, my(i = n + 1); v[i] = (3 + 6*x)*v[i - 2] + (4 + 6*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