A132393 → 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(3\,x + n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1134
229920
36335427120
42415031527081840
51208222025229512152436720
67205292146161984514175510372960480
750403920411818818276315876078246204122187604800
84032032875210631161816668181836911022483980347873265616652800
9362880307972810554300195393602181532515375339688905019026902952451968379833600
103628800318859201147821842270565002767713302191993651150165173969405086605201082565590491037836800
11399168003616315201358261784284196805237256541303241507005192277978278168410121434787037889775389723417714714529715200
1247900160044593286401738403596838178401976532337537165007504645032797878399151485485584917226743109772091016043613313817466531441217945728000
136227020800594082771202393704535045484713335928065740042368106768649985765975585372953247664511093695933332902205205953788324596609354574836113115943233487131648000
14871782912008503969420803529411180416839671003080012937450060080137691981226801050439641451258643394059252417148606015734417508825162369810603253895937752659862205167403915478296959281238016000

Generated b-files: A001715 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-dabecbb1addaf41b · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-2a63385a6c1d1a3f

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 ℚ): yes

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:      1,       3;
  2:      2,       9,        9;
  3:      6,      33,       54,       27;
  4:     24,     150,      315,      270,       81;
  5:    120,     822,     2025,     2295,     1215,      243;
  6:    720,    5292,    14616,    19845,    14175,     5103,     729;
  7:   5040,   39204,   118188,   182763,   158760,    78246,   20412,    2187;
  8:  40320,  328752,  1063116,  1816668,  1818369,  1102248,  398034,   78732,   6561;
  9: 362880, 3079728, 10554300, 19539360, 21815325, 15375339, 6889050, 1902690, 295245, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (n+3*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 3*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 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 - 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-3e76251141af3684
  • 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-3e76251141af3684
  • 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-3e76251141af3684

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.