A159854 → basis A013609 → basis A013609

nonnegative coefficientsonly rational roots

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel

Recurrence

\(P_{n}(x) = \left(4 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 9 + 24\,x + 16\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
09241649
13613216064392
214467211688962563136
35763264736082564608102425088
4230415360424966246451456225284096200704
5921670656231424419840455680295936106496163841605632
636864319488120832026050563502080300646416097284915206553612845056
7147456142540861112321525350424428544260341761846476884049922228224262144102760448
Technical details
Node id
n-16e3c94cafdff01c · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-5c747ad9ad2687a4

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:       9,       24,        16;
  1:      36,      132,       160,        64;
  2:     144,      672,      1168,       896,       256;
  3:     576,     3264,      7360,      8256,      4608,       1024;
  4:    2304,    15360,     42496,     62464,     51456,      22528,       4096;
  5:    9216,    70656,    231424,    419840,    455680,     295936,     106496,      16384;
  6:   36864,   319488,   1208320,   2605056,   3502080,    3006464,    1609728,     491520,     65536;
  7:  147456,  1425408,   6111232,  15253504,  24428544,   26034176,   18464768,    8404992,   2228224,    262144;
  8:  589824,  6291456,  30146560,  85458944, 158728192,  201850880,  177995776,  107479040,  42532864,   9961472,  1048576;
  9: 2359296, 27525120, 145752064, 462422016, 976748544, 1442316288, 1519386624, 1141899264, 600047616, 209977344, 44040192, 4194304;
%F Formula
The row polynomials satisfy P(n,x) = (4+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 9 + 24*x + 16*x^2.
%t Mathematica
P[0, x_] := 9 + 24*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[(4 + 4*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] = 9 + 24*x + 16*x^2; for(n = 1, N, my(i = n + 1); v[i] = (4 + 4*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)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.