{"id":"n-e2ca539e0aa62c2f","revision":1,"first_index":1,"fingerprint":"f6-b3d4d0fb6f0d839f","name":"basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","4"],["2","12","16"],["3","28","80","64"],["5","60","256","448","256"],["8","120","688","1856","2304","1024"],["13","232","1664","6080","11776","11264","4096"],["21","436","3760","17344","45824","68608","53248","16384"],["34","804","8096","45120","151296","310272","376832","245760","65536"],["55","1460","16816","109888","446976","1167360","1945600","1982464","1114112","262144"],["89","2620","33968","254656","1218304","3870720","8232960","11517952","10092544","4980736","1048576"],["144","4656","67104","567680","3123456","11699200","30330880","54214656","65208320","50069504","22020096","4194304"],["233","8208","130176","1226624","7631104","32936960","100843520","219987968","338231296","356253696","243269632","96468992","16777216"],["377","14372","248736","2583424","17931776","87654400","309719040","798900224","1500250112","2020081664","1890582528","1161822208","419430400","67108864"],["610","25020","469232","5325696","40803072","222842880","892928000","2661138432","5914034176","9730260992","11639193600","9793699840","5469372416","1811939328","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","30","175","1025","6000","35125","205625","1203750","7046875","41253125","241500000","1413765625","8276328125","48450468750"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167649,"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-fa986ad01f1c1b33"]},{"id":167650,"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-fa986ad01f1c1b33"]},{"id":167651,"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-fa986ad01f1c1b33"]}],"region_exact":{},"incoming_edges":[{"id":"e-fa986ad01f1c1b33","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-e2ca539e0aa62c2f","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":"3497ffbbd02fc783684eb096bd57c87a3bcf23bf7e87db2a576738644a074e4b","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-392f49b496f79fbf","role":"sequence","name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-d85d5eea9512804c","kind":"oeis_match","node_a_id":"n-e2ca539e0aa62c2f","node_b_id":null,"fingerprint":null,"oeis_id":"A057088","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":"A057088","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A057088","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-e2ca539e0aa62c2f","oeis_id":"A057088","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":24,"oeis_terms_available":24,"term_count":200,"raw_size":16251}],"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,    4;\n   3:  2,   12,    16;\n   4:  3,   28,    80,     64;\n   5:  5,   60,   256,    448,    256;\n   6:  8,  120,   688,   1856,   2304,    1024;\n   7: 13,  232,  1664,   6080,  11776,   11264,    4096;\n   8: 21,  436,  3760,  17344,  45824,   68608,   53248,   16384;\n   9: 34,  804,  8096,  45120, 151296,  310272,  376832,  245760,   65536;\n  10: 55, 1460, 16816, 109888, 446976, 1167360, 1945600, 1982464, 1114112, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+4*x)*P(n-2,x) + (1+4*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 4*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + 4*x;\nP[n_, x_] := P[n, x] = Expand[(1 + 4*x)*P[n - 2, x] + (1 + 4*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 4*x; for(n = 3, N, my(i = n); v[i] = (1 + 4*x)*v[i - 2] + (1 + 4*x)*v[i - 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}}],"derivation":{"root":"n-392f49b496f79fbf","steps":["basis A013611"],"edges":["e-fa986ad01f1c1b33"],"text":"A026729 \u2192 basis A013611"},"headline":"A026729 \u2192 basis A013611","chain":null}