A102547 → reverse → basis A013609

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0123
11449
21612827
3214364016108
43268814411232405
5442180400480288641458
66723641000160014727041285346
791227122328464057284224166425619683
8131981320504012096188161881611520384051272171
919320239210424292325488069440579843020887041024264627
10285164268208726688014694422489623833616998476800194562048971028
11418227464405201461603680646612488501767718404787201904644300840963562623
1260130012856767203076968738881803264272793630120962383872130457646284894208819213069512
138820482190014244062857619872324631232806016010490880101181447078912345907211059202048001638447947788
14129321036912259904125155243591681132384022290048334287363806668832507904203366408962048260505644236832768175906971

Computed in your browser ?

Technical details
Node id
n-da6d41f828bec089 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-0285751edb6686c9

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (affine: slope 1, intercept 1)
  • 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

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  1,   2;
  1:  1,   4,    4;
  2:  1,   6,   12,     8;
  3:  2,  14,   36,    40,    16;
  4:  3,  26,   88,   144,   112,    32;
  5:  4,  42,  180,   400,   480,   288,    64;
  6:  6,  72,  364,  1000,  1600,  1472,   704,   128;
  7:  9, 122,  712,  2328,  4640,  5728,  4224,  1664,   256;
  8: 13, 198, 1320,  5040, 12096, 18816, 18816, 11520,  3840,  512;
  9: 19, 320, 2392, 10424, 29232, 54880, 69440, 57984, 30208, 8704, 1024;
%F Formula
The row polynomials satisfy P(n,x) = (1+4*x+4*x^2)*P(n-3,x) + (1+2*x)*P(n-1,x) for n >= 3, with P(0,x) = 1 + 2*x, P(1,x) = 1 + 4*x + 4*x^2, P(2,x) = 1 + 6*x + 12*x^2 + 8*x^3.
%t Mathematica
P[0, x_] := 1 + 2*x;
P[1, x_] := 1 + 4*x + 4*x^2;
P[2, x_] := 1 + 6*x + 12*x^2 + 8*x^3;
P[n_, x_] := P[n, x] = Expand[(1 + 4*x + 4*x^2)*P[n - 3, x] + (1 + 2*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 + 2*x; v[2] = 1 + 4*x + 4*x^2; v[3] = 1 + 6*x + 12*x^2 + 8*x^3; for(n = 3, N, my(i = n + 1); v[i] = (1 + 4*x + 4*x^2)*v[i - 3] + (1 + 2*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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-9d8ee33f10e795ac
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-9d8ee33f10e795ac
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-9d8ee33f10e795ac

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

No candidate equalities or related sequences.