A269944 → basis A013609

nonnegative coefficients only rational roots

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1123
226412
3103432884
4100360388144161008
517006320731632245603219152
6442001677202028569845621008195264536256
71635400629404078411124048584974208114240627212820913984
881770000317972800404643680218111424568075687660416542080189442561087527168
9531505000020831772000269377848001498652992041287147686115421765055603223155205452851272864320256
10435834100000171883540400022505618976001282771023040368527670816584038879685368678976290984704910233615104010246120602901504
1144019244100000174474044004000230744422465600134060997122240397868367984966635848026400659044352512401268130561501305344334597124055042048630422098854912
125370347780200000213738718566880002849976762881120016816930493844480512211608366099288914713281779293675107059264621355989785626341287808070846955521163909121060864409678172340258009088
13778700428129000000310995211478016000041752140498910000002495454456865072000776340693118532800139170566425901824153611847892288641088316399307648506219871173121554106611200310460733443866071042715648819211491334017927335936
1413237907278193000000053024926036888520000071600629271103032000043257768576684424000013696882674388072000025211677678640375680288974254702071052821573615746075788810782370608558336365442098138624838604569088012781535436812348743686823936163841976509451083501780992

Generated b-files: A375043 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-3255c4dcfe77aa0b · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-7d88dc66b737aeee

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

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:          1;
  1:          1,           2;
  2:          2,           6,           4;
  3:         10,          34,          32,           8;
  4:        100,         360,         388,         144,         16;
  5:       1700,        6320,        7316,        3224,        560,        32;
  6:      44200,      167720,      202856,       98456,      21008,      1952,       64;
  7:    1635400,     6294040,     7841112,     4048584,     974208,    114240,     6272,     128;
  8:   81770000,   317972800,   404643680,   218111424,   56807568,   7660416,   542080,   18944,   256;
  9: 5315050000, 20831772000, 26937784800, 14986529920, 4128714768, 611542176, 50556032, 2315520, 54528, 512;
%F Formula
The row polynomials satisfy P(n,x) = (n^2-2*n+2+2*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[(n^2 - 2*n + 2 + 2*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (n^2 - 2*n + 2 + 2*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)

Generated with polytool c48629374597.

A375043: reversed triangle, offset 1, from the row P1
%e Example
Triangle begins:
   1:    2,      1;
   2:    4,      6,       2;
   3:    8,     32,      34,        10;
   4:   16,    144,     388,       360,        100;
   5:   32,    560,    3224,      7316,       6320,        1700;
   6:   64,   1952,   21008,     98456,     202856,      167720,        44200;
   7:  128,   6272,  114240,    974208,    4048584,     7841112,      6294040,       1635400;
   8:  256,  18944,  542080,   7660416,   56807568,   218111424,    404643680,     317972800,      81770000;
   9:  512,  54528, 2315520,  50556032,  611542176,  4128714768,  14986529920,   26937784800,   20831772000,    5315050000;
  10: 1024, 151040, 9102336, 290984704, 5368678976, 58403887968, 368527670816, 1282771023040, 2250561897600, 1718835404000, 435834100000;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (n^2-2*n+2+2*x)*P(n-1,x) for n >= 2, with P(1,x) = 1 + 2*x.
%t Mathematica
P[1, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[(n^2 - 2*n + 2 + 2*x)*P[n - 1, x]];
Table[Reverse[CoefficientList[P[n, x], x]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1 + 2*x; for(n = 2, N, my(i = n); v[i] = (n^2 - 2*n + 2 + 2*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-327e7f94e2e44f03
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-327e7f94e2e44f03
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-327e7f94e2e44f03

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

No candidate equalities or related sequences.