delannoy → basis A013609 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
14812
2197264155
3884968965121992
4409305683209728409625609
5190017688643841141769830432768329220
6882798392448448106752013967369502722621444232339
7410085324482915584871526415335424158597128912896209715254409488
8190513282364818054400649758721437941762001469441709178888178892816777216699469585
98850761474410410781312045380915212107120642121203712243846348817720934407381975041342177288992139388
10411184376052072625957696301710438494245109761992130560028837412864282087915521783418060865766686721073741824115599838091
1119102600388415952355363955219300011520690974883841711306178562990051164163683584573443133983948801752883527685798205849685899345921486111590360
12887459291967535568198081754881196881372164832004136961372462383104281094809190441808004382724479634112512337074402099216900696309765068061409286871947673619104937303321
1341229151698981783601087412327687235471037443251999309824104216246026242448955172454442707902791680552520027996165235310120140835302483689472160374078832644398046511104549755813888245606475133812
14191540385149503619704589315168960428164809267221203480408064756854833479682007437470597124017780110131206095565393756166973777321656325920709054300163616104765194241501520566681603793315115827243980465111043157432011942275
Technical details
Node id
n-3aede305f2105fb8 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-2f7e314a62f350a5

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:      4,        8;
  2:     19,       72,        64;
  3:     88,      496,       896,       512;
  4:    409,     3056,      8320,      9728,       4096;
  5:   1900,    17688,     64384,    114176,      98304,      32768;
  6:   8827,    98392,    448448,   1067520,    1396736,     950272,     262144;
  7:  41008,   532448,   2915584,   8715264,   15335424,   15859712,    8912896,    2097152;
  8: 190513,  2823648,  18054400,  64975872,  143794176,  200146944,  170917888,   81788928,  16777216;
  9: 885076, 14744104, 107813120, 453809152, 1210712064, 2121203712, 2438463488, 1772093440, 738197504, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (3+8*x)*P(n-2,x) + (4+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 8*x;
P[n_, x_] := P[n, x] = Expand[(3 + 8*x)*P[n - 2, x] + (4 + 8*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] = 4 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 8*x)*v[i - 2] + (4 + 8*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

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