A159854 → 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(2 + 6\,x + 4\,x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1 + 6\,x + 9\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
016916
1216423696
2440148240144576
3896456107212485763456
4162241296396867846144230420736
5325123488131202944039424291849216124416
664115290244019211136019660821606413516836864746496
7128256022656116480383488838656121856011345926144001474564478976
825656325555232358412328963211264579174471434245767168275251258982426873856
95121228813363286937637601281135411224428544374538244010803228573696121896962359296161243136
101024266243164162273280109977603774873694273536172621824230031360217579520138674176534773769437184967458816
11204857344739328581222431088640119488512339542016722337792115055001613552844801147666432661651456232783872377487365804752896
124096122880170803214581760854261763633315841157038080280284364851904512007312769024771647078459139686403112173568100663296015099494434828517376
13819226214439075843599564822917939210683678723767402496102338396162159227699235387342848446840176644269382041629880221696144619601924328521728603979776208971104256
14163845570568863744876216326023413763053453312118082764803553728921684119912448157143793664230917406720264123711488230535725056148444807168665048842241852204646424159191041253826625536
Technical details
Node id
n-26fdd4314504ef0a · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-063dae614330e0ae

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:   1,     6,      9;
  1:   2,    16,     42,     36;
  2:   4,    40,    148,    240,     144;
  3:   8,    96,    456,   1072,    1248,      576;
  4:  16,   224,   1296,   3968,    6784,     6144,     2304;
  5:  32,   512,   3488,  13120,   29440,    39424,    29184,     9216;
  6:  64,  1152,   9024,  40192,  111360,   196608,   216064,   135168,    36864;
  7: 128,  2560,  22656, 116480,  383488,   838656,  1218560,  1134592,   614400,   147456;
  8: 256,  5632,  55552, 323584, 1232896,  3211264,  5791744,  7143424,  5767168,  2752512,   589824;
  9: 512, 12288, 133632, 869376, 3760128, 11354112, 24428544, 37453824, 40108032, 28573696, 12189696, 2359296;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (2+6*x+4*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1 + 6*x + 9*x^2.
%t Mathematica
P[0, x_] := 1 + 6*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((2 + 6*x + 4*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 + 6*x + 9*x^2; for(n = 1, N, my(i = n + 1); v[i] = ((2 + 6*x + 4*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

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.