{"id":"n-bc0842751fa5b570","revision":1,"first_index":0,"fingerprint":"f6-6a81dd80276de4b8","name":"basis_map_A013610 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","6"],["11","45","45"],["45","279","567","378"],["197","1638","5040","6804","3402"],["903","9420","38880","79380","80190","32076"],["4279","53703","278235","761805","1162755","938223","312741"],["20793","305025","1902285","6538455","13378365","16297281","10945935","3127410"],["103049","1730124","12618144","52216164","134107974","218918700","221837616","127598328","31899582"],["518859","9811314","81931824","396589284","1226342754","2512390608","3410355312","2957961240","1487680506","330595668"],["2646723","55659825","523697265","2903215770","10501905960","25902460584","44118088560","51242328540","38844990990","17356272570","3471254514"],["13648869","315974043","3307449915","20663555220","85616296920","247031453592","506506470624","738033636780","748989916290","504221969790","202667859702","36848701764"],["71039373","1795223250","20692441440","143853482520","671802470460","2220348320784","5325528882960","9340344838440","11889428166990","10712444012820","6485371510464","2368845113400","394807518900"],["372693519","10208651544","128481634944","983756328984","5112857914164","19047722450328","52332412655952","107363147154120","164479444423866","185849644296888","150553267207200","82804296963960","27715487826780","4263921204120"],["1968801519","58103965899","792825366879","6629531864319","37953675478719","157370287629555","487374483246651","1145313070102773","2052271043970147","2790567538213455","2834478907815555","2085590458965195","1050878913432075","324591001663635","46370143094805"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","101","1269","17081","240849","3511741","52515549","801029681","12414177369","194922521301","3094216933509","49575333021801","800645021406369","13020241953611181"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"],["6","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167260,"position":0,"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-13974c051c6d411c"]},{"id":167261,"position":1,"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-13974c051c6d411c"]},{"id":167262,"position":2,"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-13974c051c6d411c"]},{"id":167263,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-13974c051c6d411c"]}],"region_exact":{},"incoming_edges":[{"id":"e-13974c051c6d411c","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-bc0842751fa5b570","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"3744950d97bbe9568008466896fdb9f604c609d3d7d618a05f696ee1b29663f5","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-66e2c3448245b0b7","role":"sequence","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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":[],"used_by_total":0,"links":[{"id":"l-9068a6aa6a58bcd1","kind":"oeis_match","node_a_id":"n-bc0842751fa5b570","node_b_id":null,"fingerprint":null,"oeis_id":"A269732","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A269732","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A269732","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-bc0842751fa5b570","oeis_id":"A269732","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":23,"oeis_terms_available":23,"term_count":200,"raw_size":25447}],"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:      3,       6;\n  2:     11,      45,       45;\n  3:     45,     279,      567,       378;\n  4:    197,    1638,     5040,      6804,       3402;\n  5:    903,    9420,    38880,     79380,      80190,      32076;\n  6:   4279,   53703,   278235,    761805,    1162755,     938223,     312741;\n  7:  20793,  305025,  1902285,   6538455,   13378365,   16297281,   10945935,    3127410;\n  8: 103049, 1730124, 12618144,  52216164,  134107974,  218918700,  221837616,  127598328,   31899582;\n  9: 518859, 9811314, 81931824, 396589284, 1226342754, 2512390608, 3410355312, 2957961240, 1487680506, 330595668;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (6*n+3+(12*n+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 6*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (6*n + 3 + (12*n + 6)*x)*P[n - 1, x])/(n + 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (6*n + 3 + (12*n + 6)*x)*v[i - 1])/(n + 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-66e2c3448245b0b7","steps":["basis A013610"],"edges":["e-13974c051c6d411c"],"text":"A033282 \u2192 basis A013610"},"headline":"A033282 \u2192 basis A013610","chain":null}