{"id":"n-3951e6b9a140d595","revision":0,"first_index":0,"fingerprint":"f6-125f57a26ac8836e","name":"Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).","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"],["3"],["12","3"],["60","45"],["360","540","45"],["2520","6300","1575"],["20160","75600","37800","1575"],["181440","952560","793800","99225"],["1814400","12700800","15876000","3969000","99225"],["19958400","179625600","314344800","130977000","9823275"],["239500800","2694384000","6286896000","3929310000","589396500","9823275"],["3113510400","42810768000","128432304000","112378266000","28094566500","1404728325"],["43589145600","719220902400","2697078384000","3146591448000","1179971793000","117997179300","1404728325"],["653837184000","12749825088000","58436698320000","87655047480000","46018899927000","7669816654500","273922023375"],["10461394944000","237996734976000","1308982042368000","2454341329440000","1718038930608000","429509732652000","30679266618000","273922023375"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","15","105","945","10395","135135","2027025","34459425","654729075","13749310575","316234143225","7905853580625","213458046676875","6190283353629375"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A306364","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","-1"],["0","0"],["-1","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169785,"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":false,"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-7c27951169024832"]},{"id":169786,"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-7c27951169024832"]},{"id":169787,"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-7c27951169024832"]},{"id":169788,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"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 >= 1","region_exact":null,"edges":["e-7c27951169024832"]}],"region_exact":{},"incoming_edges":[{"id":"e-7c27951169024832","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-3951e6b9a140d595","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"1326b2e516a895f0eabf85cef6576d162aa9a4a37ce511e888fb188d018c5454","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-1058c839fe4658dc","kind":"oeis_match","node_a_id":"n-3951e6b9a140d595","node_b_id":null,"fingerprint":null,"oeis_id":"A001147","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":"A001147","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a5da94b5c7e8afc2","kind":"oeis_match","node_a_id":"n-3951e6b9a140d595","node_b_id":null,"fingerprint":null,"oeis_id":"A306364","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":2,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":10,"target":"triangle","terms_compared":30},"in_catalog":true,"oeis_id":"A306364","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A306364","relation":"identification"},{"oeis_id":"A001147","relation":"match_row_sums"},{"oeis_id":"A306364","relation":"match_triangle"}],"bfiles":[{"node_id":"n-3951e6b9a140d595","oeis_id":"A306364","target":"triangle","oeis_offset":2,"first_row":0,"rows_used":62,"terms_matched":30,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":992,"raw_size":63975}],"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;\n  2:       12,         3;\n  3:       60,        45;\n  4:      360,       540,        45;\n  5:     2520,      6300,      1575;\n  6:    20160,     75600,     37800,      1575;\n  7:   181440,    952560,    793800,     99225;\n  8:  1814400,  12700800,  15876000,   3969000,   99225;\n  9: 19958400, 179625600, 314344800, 130977000, 9823275;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+1)*P(n-1,x) - (n^2-1-(n^2-1)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[(2*n + 1)*P[n - 1, x] - (n^2 - 1 - (n^2 - 1)*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] = 3; for(n = 2, N, my(i = n + 1); v[i] = (2*n + 1)*v[i - 1] - (n^2 - 1 - (n^2 - 1)*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}},{"oeis_id":"A306364","target":"triangle","first_row":0,"oeis_offset":2,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   2:        1;\n   3:        3;\n   4:       12,         3;\n   5:       60,        45;\n   6:      360,       540,        45;\n   7:     2520,      6300,      1575;\n   8:    20160,     75600,     37800,      1575;\n   9:   181440,    952560,    793800,     99225;\n  10:  1814400,  12700800,  15876000,   3969000,   99225;\n  11: 19958400, 179625600, 314344800, 130977000, 9823275;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-3)*P(n-1,x) - (n^2-4*n+3-(n^2-4*n+3)*x)*P(n-2,x) for n >= 4, with P(2,x) = 1, P(3,x) = 3.","mathematica":"P[2, x_] := 1;\nP[3, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[(2*n - 3)*P[n - 1, x] - (n^2 - 4*n + 3 - (n^2 - 4*n + 3)*x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 2, 11}] // Flatten","pari":"P(N) = {my(v = vector(N - 1)); v[1] = 1; v[2] = 3; for(n = 4, N, my(i = n - 1); v[i] = (2*n - 3)*v[i - 1] - (n^2 - 4*n + 3 - (n^2 - 4*n + 3)*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(11)","reading":{"first_row":0,"offset":2,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-3951e6b9a140d595","steps":[],"edges":[],"text":"A306364"},"headline":"A306364: Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).","chain":null}