basis-map coefficients of A112227 → basis A013610

nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
116916
219272764
31125410881256
4115902704052431024
5118135540121514587294096
6121189945283551035103218716384
712425215125670136082041217496656165536
81273242268102063061861236787325904919683262144
913040532401701061236153090262440295245196830590491048576
10133495445526730112266336798721710108256510825656495391771474194304
111365945940400951924566735961732104324769543302603897234212576453144116777216
121397027722579153127411250964375289284440071407334516888014138174666908733159432367108864
13142819982881081486486218918775057841970268339405366591080496448150848361131223205224782969268435456
1414594512285110565729729364864514073345422200359851341517732414724180565524180565516740391571744535143489071073741824
15148108015120147420106142458378322501928084440070225173520472864392773778096967222620892820880573956280229582512430467214294967296

Computed in your browser ?

Technical details
Node id
n-b8d8f9de0e27e805 · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-f9762973ec1089d7

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (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 ℚ): yes

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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1,  6,   9;
   2: 1,  9,  27,   27;
   3: 1, 12,  54,  108,    81;
   4: 1, 15,  90,  270,   405,    243;
   5: 1, 18, 135,  540,  1215,   1458,    729;
   6: 1, 21, 189,  945,  2835,   5103,   5103,   2187;
   7: 1, 24, 252, 1512,  5670,  13608,  20412,  17496,    6561;
   8: 1, 27, 324, 2268, 10206,  30618,  61236,  78732,   59049,   19683;
   9: 1, 30, 405, 3240, 17010,  61236, 153090, 262440,  295245,  196830,  59049;
  10: 1, 33, 495, 4455, 26730, 112266, 336798, 721710, 1082565, 1082565, 649539, 177147;
%F Formula
The row polynomials satisfy P(n,x) = (1+3*x)*P(n-1,x) for n >= 2, with P(1,x) = 1 + 6*x + 9*x^2.
%t Mathematica
P[1, x_] := 1 + 6*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[(1 + 3*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1 + 6*x + 9*x^2; for(n = 2, N, my(i = n); v[i] = (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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-33def10999a9e794
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-33def10999a9e794
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-33def10999a9e794

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

Same fingerprint (16)

Equal up to content, sign, reversal and a small index shift.