{"id":"n-4b168caf0bc63f8b","revision":1,"first_index":1,"fingerprint":"f6-d272e4b2958d4a94","name":"T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","6"],["1","12","6"],["1","20","30"],["1","30","90","20"],["1","42","210","140"],["1","56","420","560","70"],["1","72","756","1680","630"],["1","90","1260","4200","3150","252"],["1","110","1980","9240","11550","2772"],["1","132","2970","18480","34650","16632","924"],["1","156","4290","34320","90090","72072","12012"],["1","182","6006","60060","210210","252252","84084","3432"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","3","7","19","51","141","393","1107","3139","8953","25653","73789","212941","616227"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A089627","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["3"],["-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","8"],["1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160086,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-4d3032ecd7423900"]},{"id":160087,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-4d3032ecd7423900"]},{"id":160088,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-4d3032ecd7423900"]}],"region_exact":{},"incoming_edges":[{"id":"e-4d3032ecd7423900","operation":{"index_shift":-1,"operation":"preserver_image","operator":"{\"shape\":\"hadamard_multiplier\",\"factor\":{\"terms\":[{\"kind\":\"inverse_factorial\"}]}}"},"operation_detail":"hadamard_multiplier, shift -1","conclusion_id":"n-4b168caf0bc63f8b","premise_count":1,"theorem":"Polya--Schur characterization of multiplier sequences (G. Polya and I. Schur, J. Reine Angew. Math. 144 (1914) 89--113; stated as Theorem 40 of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601): a real sequence (lambda_k) is a multiplier sequence (x^k -> lambda_k x^k maps real-rooted polynomials to real-rooted polynomials or zero) iff sum_k binom(m,k) lambda_k x^k is real-rooted with zeros of one sign for every m, iff sum_k lambda_k x^k / k! (or its reflection) is C x^m e^(a x) prod (1 + alpha_j x) with a, alpha_j >= 0; a product of multiplier sequences is one (composition), and a nonzero factor lambda(n) of the row changes nothing","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_inv_factorial"],"certificate_hash":"56c8f23718ba9a590f3d23913e738d125a74cfe172c0ead280f96e49ae3a2868","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-c914b69838ac70ec","role":"sequence","name":"Triangle read by rows: row n consists of the nonzero coefficients of the expansion of 2^n x^n in terms of Hermite polynomials with decreasing subscripts.","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-23d8897c84d2236f","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-15c46876416f2009","conclusion_name":"theta_plus_one_squared of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows."},{"id":"e-272eb8130991447b","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-f88ecd1d5f2ce358","conclusion_name":"one_plus_derivative of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows."},{"id":"e-502ba5da9494e9e3","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-123dac0e8ec7cfb1","conclusion_name":"shift_x_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows."},{"id":"e-65103a54d767b0ce","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-66e4d09f0f7c919b","conclusion_name":"theta_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows."},{"id":"e-65da073036a5e795","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-f842b394609a16be","conclusion_name":"derivative of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows."}],"used_by_total":5,"links":[{"id":"l-5eabc7e5f0d8e564","kind":"fingerprint_related","node_a_id":"n-4b168caf0bc63f8b","node_b_id":"n-8bfdd58279be42d7","fingerprint":"f6-d272e4b2958d4a94","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d272e4b2958d4a94"},"other_id":"n-8bfdd58279be42d7","other":{"id":"n-8bfdd58279be42d7","name":"Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).","first_index":0,"fingerprint":"f6-d272e4b2958d4a94","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","2"]],"card_rows":[["1"],["1"],["1","2"],["1","6"]],"row_sums_preview":["1","1","3","7","19","51","141","393"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A391403"],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["\u2299 C(n,k)"],"edges":["e-2126fae20f2e5116"],"text":"A011973 \u2192 \u2299 C(n,k)"},"headline":"A391403: Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).","chain":"A011973 \u2192 \u2299 C(n,k)"}},{"id":"l-77689e5e55ca6f47","kind":"fingerprint_related","node_a_id":"n-4b168caf0bc63f8b","node_b_id":"n-ce7f61ca1eb91390","fingerprint":"f6-d272e4b2958d4a94","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d272e4b2958d4a94"},"other_id":"n-ce7f61ca1eb91390","other":{"id":"n-ce7f61ca1eb91390","name":"gamma_polynomial of Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","first_index":0,"fingerprint":"f6-d272e4b2958d4a94","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["6","12"]],"card_rows":[["1"],["2"],["6","12"],["20","120"]],"row_sums_preview":["1","2","18","140","1330","12852","130284","1348776"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-fdc03fad975441d0","steps":["\u03b3"],"edges":["e-510754e51c3ada00"],"text":"A069466 \u2192 \u03b3"},"headline":"A069466 \u2192 \u03b3","chain":null}},{"id":"l-2e3ab423a7a6745d","kind":"oeis_match","node_a_id":"n-4b168caf0bc63f8b","node_b_id":null,"fingerprint":null,"oeis_id":"A002426","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A002426","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-91912bd0b927d2c5","kind":"oeis_match","node_a_id":"n-4b168caf0bc63f8b","node_b_id":null,"fingerprint":null,"oeis_id":"A391403","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":14,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":14,"target":"triangle","terms_compared":56},"in_catalog":true,"oeis_id":"A391403","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A089627","relation":"identification"},{"oeis_id":"A002426","relation":"match_row_sums"},{"oeis_id":"A391403","relation":"match_triangle"}],"bfiles":[{"node_id":"n-4b168caf0bc63f8b","oeis_id":"A002426","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":200,"raw_size":10239},{"node_id":"n-4b168caf0bc63f8b","oeis_id":"A391403","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":62,"terms_matched":56,"oeis_terms_agreeing":56,"oeis_terms_available":56,"term_count":992,"raw_size":18365}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 1;\n   3: 1,  2;\n   4: 1,  6;\n   5: 1, 12,   6;\n   6: 1, 20,  30;\n   7: 1, 30,  90,   20;\n   8: 1, 42, 210,  140;\n   9: 1, 56, 420,  560,  70;\n  10: 1, 72, 756, 1680, 630;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = -(2*n-3)*P(n-1,x) + (n-2-(4*n-8)*x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 3)*P[n - 1, x] + (n - 2 - (4*n - 8)*x)*P[n - 2, x])/(-n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); v[i] = (-(2*n - 3)*v[i - 1] + (n - 2 - (4*n - 8)*x)*v[i - 2])/(-n + 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A391403","target":"triangle","first_row":1,"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: 1;\n  2: 1,  2;\n  3: 1,  6;\n  4: 1, 12,   6;\n  5: 1, 20,  30;\n  6: 1, 30,  90,   20;\n  7: 1, 42, 210,  140;\n  8: 1, 56, 420,  560,  70;\n  9: 1, 72, 756, 1680, 630;\n","recurrence_sentence":"The row polynomials satisfy -n*P(n,x) = -(2*n-1)*P(n-1,x) + (n-1-(4*n-4)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 1)*P[n - 1, x] + (n - 1 - (4*n - 4)*x)*P[n - 2, x])/(-n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (-(2*n - 1)*v[i - 1] + (n - 1 - (4*n - 4)*x)*v[i - 2])/(-n)); 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":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-c914b69838ac70ec","steps":["\u2299 1/k! (shift -1)"],"edges":["e-4d3032ecd7423900"],"text":"A059344 \u2192 \u2299 1/k! (shift -1)"},"headline":"A089627: T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.","chain":"A059344 \u2192 \u2299 1/k! (shift -1)"}