{"id":"n-cf38558d99f4fe37","revision":2,"first_index":0,"fingerprint":"f6-ce65a3e6fcbea790","name":"Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2"],["3","4"],["4","16"],["5","40","16"],["6","80","96"],["7","140","336","64"],["8","224","896","512"],["9","336","2016","2304","256"],["10","480","4032","7680","2560"],["11","660","7392","21120","14080","1024"],["12","880","12672","50688","56320","12288"],["13","1144","20592","109824","183040","79872","4096"],["14","1456","32032","219648","512512","372736","57344"],["15","1820","48048","411840","1281280","1397760","430080","16384"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","7","20","61","182","547","1640","4921","14762","44287","132860","398581","1195742","3587227"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A229032","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:gamma_polynomial","source_kind":"derived","equality_edge_id":"e-3864cd74360cd35e","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160411,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 1/4]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"1/4"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1/4]","region_exact":null,"edges":["e-44df003225948a93"]},{"id":160412,"position":1,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-e2e7a7b682b47947"]},{"id":160413,"position":2,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-e2e7a7b682b47947"]},{"id":160414,"position":3,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-e2e7a7b682b47947"]}],"region_exact":{},"incoming_edges":[{"id":"e-3864cd74360cd35e","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-cf38558d99f4fe37","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"81147553b888d671ac8d2314bfff160ea0efe9247b625f4af164e8c278c04901","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-e2e7a7b682b47947","operation":{"index_shift":0,"operation":"gamma_polynomial","scale":"1"},"operation_detail":"scale 1, shift 0","conclusion_id":"n-cf38558d99f4fe37","premise_count":1,"theorem":"gamma criterion (RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff): if P = sum_j gamma_j x^j (1 + x)^(d - 2j) with deg Gamma <= d/2, then P is nonzero and real-rooted with roots in (-inf, 0] if and only if Gamma(z) = sum_j gamma_j z^j is; Gamma(c z) with c != 0 has the roots of Gamma divided by c","lean_route":null,"lean_declarations":[],"certificate_hash":"40c04eed59dd1c97fae4c6570133e875e3c14ab85c5a74e89dcbe8970e7a1a4a","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-2245b35ec7cd4857","role":"sequence","name":"One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},{"id":"e-44df003225948a93","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-1/4\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-cf38558d99f4fe37","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"46d67acc67422adc7d8a460f5f767e264e3e90b9b296bcb93015d586830cc6ec","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"1/4"}}}],"premises":[{"position":0,"node_id":"n-75ccd0453a9b6cec","role":"sequence","name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[{"id":"e-7b35457a4f9e8cf8","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-e5bdf85b655e989a","conclusion_name":"shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-85c5f3f1ee78f4c4","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-0f3a09cf4735e4dd","conclusion_name":"derivative of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-8f28dc5012800fde","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-f73899c01faa2980","conclusion_name":"theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-a96f03eb4914ee6b","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-1dcbd37809a2c598","conclusion_name":"theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-fe74f628d5055d01","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-92abebe007fb10d9","conclusion_name":"one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-257278eb9a50cd75","operation":"veronese_section","operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-b4fec57cd202e0f7","conclusion_name":"veronese_section_2_0 of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-a5a16e178035b04e","operation":"veronese_section","operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-3823d7dcffdc2ba2","conclusion_name":"veronese_section_2_1 of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."}],"used_by_total":7,"links":[{"id":"l-0846f19d4cae7d38","kind":"fingerprint_related","node_a_id":"n-cf38558d99f4fe37","node_b_id":"n-1864d83319c9138c","fingerprint":"f6-ce65a3e6fcbea790","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ce65a3e6fcbea790"},"other_id":"n-1864d83319c9138c","other":{"id":"n-1864d83319c9138c","name":"veronese_section_2_1 of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-ce65a3e6fcbea790","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["4"]],"card_rows":[["2"],["4"],["6","8"],["8","32"]],"row_sums_preview":["0","2","4","14","40","122","364","1094"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["Veronese 2 (j=1)"],"edges":["e-c6792048648d3d6d"],"text":"A013609 \u2192 Veronese 2 (j=1)"},"headline":"A013609 \u2192 Veronese 2 (j=1)","chain":null}},{"id":"l-8902cfa12cf8bd0b","kind":"fingerprint_related","node_a_id":"n-cf38558d99f4fe37","node_b_id":"n-82e38e2652e8d358","fingerprint":"f6-ce65a3e6fcbea790","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ce65a3e6fcbea790"},"other_id":"n-82e38e2652e8d358","other":{"id":"n-82e38e2652e8d358","name":"veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","first_index":0,"fingerprint":"f6-ce65a3e6fcbea790","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["6"],["12"]],"card_rows":[["6"],["12"],["18","24"],["24","96"]],"row_sums_preview":["0","6","12","42","120","366","1092","3282"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-765f9e2b013b3c68","steps":["Veronese 2 (j=1)"],"edges":["e-1dcfbe1f89fd593f"],"text":"A120909 \u2192 Veronese 2 (j=1)"},"headline":"A120909 \u2192 Veronese 2 (j=1)","chain":null}},{"id":"l-0abc6c5584666fe1","kind":"oeis_match","node_a_id":"n-cf38558d99f4fe37","node_b_id":null,"fingerprint":null,"oeis_id":"A015518","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A015518","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A229032","relation":"identification"},{"oeis_id":"A015518","relation":"match_row_sums"}],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1:  2;\n  2:  3,   4;\n  3:  4,  16;\n  4:  5,  40,   16;\n  5:  6,  80,   96;\n  6:  7, 140,  336,   64;\n  7:  8, 224,  896,  512;\n  8:  9, 336, 2016, 2304,  256;\n  9: 10, 480, 4032, 7680, 2560;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) - (1-4*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - (1 - 4*x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = 2*v[i - 1] - (1 - 4*x)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["x \u21a6 x\u22121/4"],"edges":["e-44df003225948a93"],"text":"A011973 \u2192 x \u21a6 x\u22121/4"},"headline":"A229032: Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).","chain":"A011973 \u2192 x \u21a6 x\u22121/4"}