A038291 → basis A013609 → x ↦ x/(x+1)

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(1 + x\right)\,P_{n}(x) = \left(10 + 22\,x + 12\,x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1101222
2100240144484
3100036004320172810648
41000048000864006912020736234256
51000006000001440000172800010368002488325153632
610000007200000216000003456000031104000149299202985984113379904
71000000084000000302400000604800000725760000522547200209018880358318082494357888
Technical details
Node id
n-aa3a32290f637d6d · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-da2debf48cb6165b

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:         10,          12;
  2:        100,         240,         144;
  3:       1000,        3600,        4320,         1728;
  4:      10000,       48000,       86400,        69120,        20736;
  5:     100000,      600000,     1440000,      1728000,      1036800,       248832;
  6:    1000000,     7200000,    21600000,     34560000,     31104000,     14929920,      2985984;
  7:   10000000,    84000000,   302400000,    604800000,    725760000,    522547200,    209018880,     35831808;
  8:  100000000,   960000000,  4032000000,   9676800000,  14515200000,  13934592000,   8360755200,   2866544640,   429981696;
  9: 1000000000, 10800000000, 51840000000, 145152000000, 261273600000, 313528320000, 250822656000, 128994508800, 38698352640, 5159780352;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (10+22*x+12*x^2)*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[((10 + 22*x + 12*x^2)*P[n - 1, x])/(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] = ((10 + 22*x + 12*x^2)*v[i - 1])/(1 + x)); 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

Candidate equalities ?

Same fingerprint ?

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [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
  5. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  6. [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
  7. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.