{"id":"n-5e9bc8ceab9ca150","revision":0,"first_index":0,"fingerprint":"f6-5b59c7b03149f9b5","name":"basis_map_A013610 of 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"],["15","9"],["105","135"],["945","1890","405"],["10395","28350","14175"],["135135","467775","382725","42525"],["2027025","8513505","9823275","2679075"],["34459425","170270100","255405150","117879300","8037225"],["654729075","3721617900","6895939050","4597292700","795685275"],["13749310575","88388425125","195384939750","172398476250","51719542875","2387055825"],["316234143225","2268636244875","5833636058250","6447703011750","2844574858125","341348982975"],["7905853580625","62614360358550","183759535834875","245012714446500","145073317764375","30721408467750","1024046948925"],["213458046676875","1849969737866250","6104900134958625","9555495863413500","7166621897560125","2263143757124250","199689155040375"],["6190283353629375","58274046742786875","213671504723551875","384608708502393375","351164472980446125","150499059848762625","23763009449804625","599067465121125"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","24","240","3240","52920","1028160","23042880","586051200","16665264000","524027750400","18052133299200","676111237401600","27353278592640000","1188770153066496000"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-3"],["0","0"],["0","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":203156,"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-6463d3d90d256a8f"]},{"id":203157,"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-6463d3d90d256a8f"]},{"id":203158,"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-6463d3d90d256a8f"]},{"id":203159,"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-6463d3d90d256a8f"]}],"region_exact":{},"incoming_edges":[{"id":"e-6463d3d90d256a8f","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-5e9bc8ceab9ca150","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":"1e102d52a8eb8305f4772e1fd126a2e840a2b227c98d07e904bfcf3f0b442e51","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-3951e6b9a140d595","role":"sequence","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).","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":[],"oeis":[],"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:         3;\n  2:        15,          9;\n  3:       105,        135;\n  4:       945,       1890,        405;\n  5:     10395,      28350,      14175;\n  6:    135135,     467775,     382725,      42525;\n  7:   2027025,    8513505,    9823275,    2679075;\n  8:  34459425,  170270100,  255405150,  117879300,   8037225;\n  9: 654729075, 3721617900, 6895939050, 4597292700, 795685275;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n^2-3)*x*P(n-2,x) + (2*n+1)*P(n-1,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[(3*n^2 - 3)*x*P[n - 2, x] + (2*n + 1)*P[n - 1, 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] = (3*n^2 - 3)*x*v[i - 2] + (2*n + 1)*v[i - 1]); 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-3951e6b9a140d595","steps":["basis A013610"],"edges":["e-6463d3d90d256a8f"],"text":"A306364 \u2192 basis A013610"},"headline":"A306364 \u2192 basis A013610","chain":null}
