{"id":"n-92be85f47bd42a26","revision":1,"first_index":1,"fingerprint":"f6-f0bc0625362e6d07","name":"Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["2"],["8","8"],["20","56","20"],["40","216","216","40"],["70","616","1188","616","70"],["112","1456","4576","4576","1456","112"],["168","3024","14040","22880","14040","3024","168"],["240","5712","36720","88400","88400","36720","5712","240"],["330","10032","85272","284240","419900","284240","85272","10032","330"],["440","16632","180576","795872","1627920","1627920","795872","180576","16632","440"],["572","26312","355212","1999712","5408312","7488432","5408312","1999712","355212","26312","572"],["728","40040","657800","4604600","15906800","29121680","29121680","15906800","4604600","657800","40040","728"],["910","58968","1158300","9867000","42383250","99111600","131047560","99111600","42383250","9867000","1158300","58968","910"],["1120","84448","1954368","19905600","104052000","302551200","510975360","510975360","302551200","104052000","19905600","1954368","84448","1120"],["1360","118048","3178864","38146368","238414800","843621600","1771605360","2262890880","1771605360","843621600","238414800","38146368","3178864","118048","1360"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","16","96","512","2560","12288","57344","262144","1179648","5242880","23068672","100663296","436207616","1879048192","8053063680"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A375853","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","2"],["-1","-3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159943,"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":false,"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-b3e0ac60e2e16f0a"]},{"id":159944,"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-b3e0ac60e2e16f0a"]},{"id":159945,"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-b3e0ac60e2e16f0a"]},{"id":159946,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-b3e0ac60e2e16f0a"]}],"region_exact":{},"incoming_edges":[{"id":"e-b3e0ac60e2e16f0a","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-92be85f47bd42a26","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"7686b08800e89bd18946ad88bcd5c294bee6603ab3b10846817bf9519bc07374","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-01a8bab2955d58ac","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-1fefd5af9c8edffe","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1."},{"id":"e-01a8bab2955d58ac","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-1fefd5af9c8edffe","conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1."}],"used_by_total":2,"links":[{"id":"l-21688a7cf61b4bb9","kind":"oeis_match","node_a_id":"n-92be85f47bd42a26","node_b_id":null,"fingerprint":null,"oeis_id":"A375853","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":2,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A375853","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-4a8d543df736acda","kind":"oeis_match","node_a_id":"n-92be85f47bd42a26","node_b_id":null,"fingerprint":null,"oeis_id":"A375853","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":2,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A375853","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-d702698cc2522b36","kind":"oeis_match","node_a_id":"n-92be85f47bd42a26","node_b_id":null,"fingerprint":null,"oeis_id":"A002699","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A002699","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A375853","relation":"identification"},{"oeis_id":"A375853","relation":"match_reversed_triangle"},{"oeis_id":"A002699","relation":"match_row_sums"},{"oeis_id":"A375853","relation":"match_triangle"}],"bfiles":[{"node_id":"n-92be85f47bd42a26","oeis_id":"A375853","target":"triangle","oeis_offset":2,"first_row":1,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":18865},{"node_id":"n-92be85f47bd42a26","oeis_id":"A375853","target":"reversed_triangle","oeis_offset":2,"first_row":1,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":18865}],"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:   2;\n   2:   8,     8;\n   3:  20,    56,     20;\n   4:  40,   216,    216,     40;\n   5:  70,   616,   1188,    616,      70;\n   6: 112,  1456,   4576,   4576,    1456,     112;\n   7: 168,  3024,  14040,  22880,   14040,    3024,    168;\n   8: 240,  5712,  36720,  88400,   88400,   36720,   5712,    240;\n   9: 330, 10032,  85272, 284240,  419900,  284240,  85272,  10032,   330;\n  10: 440, 16632, 180576, 795872, 1627920, 1627920, 795872, 180576, 16632, 440;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = -(n+2+(3*n-2)*x)*P(n-1,x) - (2*x-2*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.","mathematica":"P[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n + 2 + (3*n - 2)*x)*P[n - 1, x] - (2*x - 2*x^2)*D[P[n - 1, x], x])/(-n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = (-(n + 2 + (3*n - 2)*x)*v[i - 1] - (2*x - 2*x^2)*deriv(v[i - 1], x))/(-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":"A375853","target":"triangle","first_row":1,"oeis_offset":2,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   2:   2;\n   3:   8,     8;\n   4:  20,    56,     20;\n   5:  40,   216,    216,     40;\n   6:  70,   616,   1188,    616,      70;\n   7: 112,  1456,   4576,   4576,    1456,     112;\n   8: 168,  3024,  14040,  22880,   14040,    3024,    168;\n   9: 240,  5712,  36720,  88400,   88400,   36720,   5712,    240;\n  10: 330, 10032,  85272, 284240,  419900,  284240,  85272,  10032,   330;\n  11: 440, 16632, 180576, 795872, 1627920, 1627920, 795872, 180576, 16632, 440;\n","recurrence_sentence":"The row polynomials satisfy -(n-2)*P(n,x) = -(n+1+(3*n-5)*x)*P(n-1,x) - (2*x-2*x^2)*d/dx P(n-1,x) for n >= 3, with P(2,x) = 2.","mathematica":"P[2, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n + 1 + (3*n - 5)*x)*P[n - 1, x] - (2*x - 2*x^2)*D[P[n - 1, x], x])/(-n + 2)]];\nTable[PadRight[CoefficientList[P[n, x], x], n - 1], {n, 2, 11}] // Flatten","pari":"P(N) = {my(v = vector(N - 1)); v[1] = 2; for(n = 3, N, my(i = n - 1); v[i] = (-(n + 1 + (3*n - 5)*x)*v[i - 1] - (2*x - 2*x^2)*deriv(v[i - 1], x))/(-n + 2)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 1, v[i])))};\nT(11)","reading":{"first_row":1,"offset":2,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A375853","target":"reversed_triangle","first_row":1,"oeis_offset":2,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   2:   2;\n   3:   8,     8;\n   4:  20,    56,     20;\n   5:  40,   216,    216,     40;\n   6:  70,   616,   1188,    616,      70;\n   7: 112,  1456,   4576,   4576,    1456,     112;\n   8: 168,  3024,  14040,  22880,   14040,    3024,    168;\n   9: 240,  5712,  36720,  88400,   88400,   36720,   5712,    240;\n  10: 330, 10032,  85272, 284240,  419900,  284240,  85272,  10032,   330;\n  11: 440, 16632, 180576, 795872, 1627920, 1627920, 795872, 180576, 16632, 440;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where -(n-2)*P(n,x) = -(n+1+(3*n-5)*x)*P(n-1,x) - (2*x-2*x^2)*d/dx P(n-1,x) for n >= 3, with P(2,x) = 2.","mathematica":"P[2, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n + 1 + (3*n - 5)*x)*P[n - 1, x] - (2*x - 2*x^2)*D[P[n - 1, x], x])/(-n + 2)]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n - 1]], {n, 2, 11}] // Flatten","pari":"P(N) = {my(v = vector(N - 1)); v[1] = 2; for(n = 3, N, my(i = n - 1); v[i] = (-(n + 1 + (3*n - 5)*x)*v[i - 1] - (2*x - 2*x^2)*deriv(v[i - 1], x))/(-n + 2)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 1, v[i])))};\nT(11)","reading":{"first_row":1,"offset":2,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-92be85f47bd42a26","steps":[],"edges":[],"text":"A375853"},"headline":"A375853: Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","chain":null}