A099040 → basis A013610

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(2 + 6\,x\right)\,P_{n-2}(x) + \left(2 + 6\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 6\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1268
26303672
316120288216640
4444321548237612965696
5120146469841620018144777650688
63284776284408834415033613219246656451072
78961516810828842163296422412908169331202799364014080
8244847232393120184032052889769533376104976006438528167961635721216
9668814486413772167532352260781125916758487806592820212484367001610077696317882368
1018272439008469324829367360118970208325604448608814144766744704621457920292253184604661762828828672
114992013175041564416011022220851149491216398339843701873664587725632064228515844595429376193491763236279705625173688320
12136384392217651213888401203584209846764877136675842041400620839152128896539526251525204122214433316862976126978969602176782336224020135936
1337260811597184165154176142399987282884798723436677849610435276915223475404966439092726476847552616345641032347033623763207168082717728768130606940161993550594048
141017984340926725258522884948615296317251157761464825772805020162272001296413009280253319685120037244141107204052684980224316250193715216717688340485354884546567836416409617740565839872

Generated b-files: A057091 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-0892e4c474e4320d · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-3f5c634f6f648d33

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

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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;
  1:    2,      6;
  2:    6,     30,      36;
  3:   16,    120,     288,     216;
  4:   44,    432,    1548,    2376,     1296;
  5:  120,   1464,    6984,   16200,    18144,     7776;
  6:  328,   4776,   28440,   88344,   150336,   132192,    46656;
  7:  896,  15168,  108288,  421632,   964224,  1290816,   933120,   279936;
  8: 2448,  47232,  393120, 1840320,  5288976,  9533376, 10497600,  6438528,  1679616;
  9: 6688, 144864, 1377216, 7532352, 26078112, 59167584, 87806592, 82021248, 43670016, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (2+6*x)*P(n-2,x) + (2+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 6*x;
P[n_, x_] := P[n, x] = Expand[(2 + 6*x)*P[n - 2, x] + (2 + 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] = 2 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 6*x)*v[i - 2] + (2 + 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)

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-ab2091a27c0ed1a5
  • 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-ab2091a27c0ed1a5
  • 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-ab2091a27c0ed1a5

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.

References

  1. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741