basis-map coefficients of A026729, shifted → D → basis A013610

only rational roots

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

Recurrence

\(\left(-2 + n\right)\,P_{n}(x) = \left(1 + 3\,x - n - 3\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = -1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13Pn(1)
10
2-1-1
3268
4-3-18-27-48
5436108108256
6-5-60-270-540-405-1280
76905401620243014586144
8-7-126-945-3780-8505-10206-5103-28672
981681512756022680408244082417496131072
10-9-216-2268-13608-51030-122472-183708-157464-59049-589824
11102703240226801020603061806123607873205904901968302621440
12-11-330-4455-35640-187110-673596-1683990-2886840-3247695-2165130-649539-11534336
131239659405346032076013471924041576866052012990780129907807794468212576450331648
14-13-468-7722-77220-521235-2501928-8756748-22517352-42220035-56293380-50664042-27634932-6908733-218103808
15145469828108108810810437837417513496525404881182160981970268302364321961934445249672226222320522939524096
Technical details
Node id
n-ae0141b3752bd1a9 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-f9762973ec1089d7

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): no
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:  0;
   2: -1;
   3:  2,    6;
   4: -3,  -18,   -27;
   5:  4,   36,   108,    108;
   6: -5,  -60,  -270,   -540,   -405;
   7:  6,   90,   540,   1620,   2430,    1458;
   8: -7, -126,  -945,  -3780,  -8505,  -10206,   -5103;
   9:  8,  168,  1512,   7560,  22680,   40824,   40824,   17496;
  10: -9, -216, -2268, -13608, -51030, -122472, -183708, -157464, -59049;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(n-1+(3*n-3)*x)*P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = -1.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := -1;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 1 + (3*n - 3)*x)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = -1; for(n = 3, N, my(i = n); v[i] = (-(n - 1 + (3*n - 3)*x)*v[i - 1])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.