A152198 → basis A013609 → basis A013609

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:   1;
  1:   1;
  2:   4,    4;
  3:   4,    4;
  4:  16,   32,   16;
  5:  16,   32,   16;
  6:  64,  192,  192,   64;
  7:  64,  192,  192,   64;
  8: 256, 1024, 1536, 1024, 256;
  9: 256, 1024, 1536, 1024, 256;

The row polynomials satisfy P(n,x) = (4+4*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.

P[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4 + 4*x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (4 + 4*x)*v[i - 2]); 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)

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Geometric basis map (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Geometric basis map (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Geometric basis map (elementary)

Proof chains ? JSON

• Geometric basis map (elementary) polytool ? step ›

  • from basis_map_A013609 of Triangle read by rows, A007318 rows repeated.?
    • Geometric basis map (elementary) polytool ? step ›

      • from Triangle read by rows, A007318 rows repeated.?
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle read by rows: triangle of repeated stepped binomial coefficients.?
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
        • Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›

          • from Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …?
            • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = …?
                • ↑ Iterated real-rootedness preservers (above)
                • ↑ Parent-row provers of polytool (above)
        • Iterated real-rootedness preservers [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ? step › direct check
        • Parent-row provers of polytool polytool ? step › direct check

Related ?

Same fingerprint ?

• A274496 → basis A013609
• A152198 → basis A013609
• A274496 → D → D
• A152198 → basis A013609 → D
• A274496 → D
• A103633: Triangle read by rows: triangle of repeated stepped binomial coefficients.
• A152198 → D
• A132774 → Veronese 2 → x ↦ x+1
• A132774 → Veronese 2 (j=1) → x ↦ x+1
• A274496: Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k …
• A152198: Triangle read by rows, A007318 rows repeated.

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.