A038305 → 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(13 + 9\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 169 + 234\,x + 81\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
016923481484
121974563315972910648
2285617909282134379086561234256
3371293128524517795701232010426465590495153632
44826809200498223470161532032260166321354605822531441113379904
5627485173040889676315693937287339155045080952095649014836113147829692494357888
68157307214517893224109472028121515766543213117210470726491656825147788124974287764304672154875873536
71060449937366074188401182974675572295574475924306942724998212498809614980763736682909958339650364663573874204891207269217792

Computed in your browser ?

Technical details
Node id
n-7e380db7ce29966b · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-421bc4a701fbf074

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 2)
  • 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:           169,            234,             81;
  1:          2197,           4563,           3159,            729;
  2:         28561,          79092,          82134,          37908,            6561;
  3:        371293,        1285245,        1779570,        1232010,          426465,           59049;
  4:       4826809,       20049822,       34701615,       32032260,        16632135,         4605822,         531441;
  5:      62748517,      304088967,      631569393,      728733915,       504508095,       209564901,       48361131,        4782969;
  6:     815730721,     4517893224,    10947202812,    15157665432,     13117210470,      7264916568,     2514778812,      497428776,       43046721;
  7:   10604499373,    66074188401,   182974675572,   295574475924,    306942724998,    212498809614,    98076373668,    29099583396,     5036466357,     387420489;
  8:  137858491849,   954404943570,  2973338478045,  5489240267160,   6650425708290,   5524969049964,  3187482144210,  1260981947160,   327370313205,   50364663570,   3486784401;
  9: 1792160394037, 13647990693051, 47243044706715, 98120169775485, 135858696612210, 131678429024142, 91161989324406, 45080104610970, 15604651596105, 3601073445255, 498610169343, 31381059609;
%F Formula
The row polynomials satisfy P(n,x) = (13+9*x)*P(n-1,x) for n >= 1, with P(0,x) = 169 + 234*x + 81*x^2.
%t Mathematica
P[0, x_] := 169 + 234*x + 81*x^2;
P[n_, x_] := P[n, x] = Expand[(13 + 9*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] = 169 + 234*x + 81*x^2; for(n = 1, N, my(i = n + 1); v[i] = (13 + 9*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-c80be26a429cc3fc
  • 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-c80be26a429cc3fc
  • 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-c80be26a429cc3fc

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. [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