A178822 → basis A013609 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(n\right)\,P_{n}(x) = \left(20 + 40\,x + 4\,n + 8\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1244872
2336134413443024
3358421504430082867296768
43225625804877414410321925160962612736
52580482580480103219202064384020643840825753662705664
61892352227082241135411203027763204541644803633315841211105281379524608
71297612818166579210899947523633315840726663168087199580165813305344166094438428378791936
Technical details
Node id
n-df93d57821958126 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-11aec07ce60b6d61

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         1;
  1:        24,         48;
  2:       336,       1344,        1344;
  3:      3584,      21504,       43008,        28672;
  4:     32256,     258048,      774144,      1032192,        516096;
  5:    258048,    2580480,    10321920,     20643840,      20643840,       8257536;
  6:   1892352,   22708224,   113541120,    302776320,     454164480,     363331584,     121110528;
  7:  12976128,  181665792,  1089994752,   3633315840,    7266631680,    8719958016,    5813305344,    1660944384;
  8:  84344832, 1349517312,  9446621184,  37786484736,   94466211840,  151145938944,  151145938944,   86369107968,   21592276992;
  9: 524812288, 9446621184, 75572969472, 352673857536, 1058021572608, 2116043145216, 2821390860288, 2418335023104, 1209167511552, 268703891456;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n+20+(8*n+40)*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[Together[((4*n + 20 + (8*n + 40)*x)*P[n - 1, x])/(n)]];
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] = ((4*n + 20 + (8*n + 40)*x)*v[i - 1])/(n)); 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. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.