{"id":"n-39f1ca0006673cbd","revision":0,"first_index":0,"fingerprint":"f6-1bf4f6258e36ae6b","name":"basis_map_A007318 of basis_map_A013609 of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["7","4"],["31","32","8"],["145","216","104","16"],["673","1312","936","288","32"],["3127","7532","7112","3280","736","64"],["14527","41664","48944","30080","10176","1792","128"],["67489","224560","315504","242272","109632","29184","4224","256"],["313537","1187264","1941296","1788224","1013760","361728","79232","9728","512"],["1456615","6184788","11535344","12393312","8444928","3781248","1111424","206592","22016","1024"],["6767071","31841248","66709368","81891200","65184064","35127552","12969344","3236864","522240","49152","2048"],["31438129","162366728","377495576","521234160","474640064","299111936","133029248","41728768","9041920","1288192","108544","4096"],["146053729","821401056","2098526360","3219020128","3300363168","2381478656","1239504000","468622848","127665664","24428544","3115008","237568","8192"],["678529303","4127688124","11494127736","19391826864","22105881440","17973256896","10718284928","4744744192","1558491648","374993920","64219136","7409664","516096","16384"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","11","71","481","3241","21851","147311","993121","6695281","45137291","304300151","2051487361","13830424921","93239986331"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195435,"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-2c7a01782dad3994"]},{"id":195436,"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-2c7a01782dad3994"]},{"id":195437,"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-2c7a01782dad3994"]},{"id":195438,"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-2c7a01782dad3994"]}],"region_exact":{},"incoming_edges":[{"id":"e-2c7a01782dad3994","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-39f1ca0006673cbd","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":"f73599a1419848aee3ac7bb4da0894d34c5aedacd58acdff4f9280b96043bacb","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-45d316ccbe3d57d1","role":"sequence","name":"basis_map_A013609 of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","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-db825097d964877f","kind":"candidate_equal","node_a_id":"n-9681de120ff6e17e","node_b_id":"n-39f1ca0006673cbd","fingerprint":null,"oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"reason":"no all-index equality certificate was found","rows_compared":15},"other_id":"n-9681de120ff6e17e","other":{"id":"n-9681de120ff6e17e","name":"shift_x_plus_one of basis_map_A013609 of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","first_index":0,"fingerprint":"f6-1bf4f6258e36ae6b","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["7","4"]],"card_rows":[["1"],["1"],["7","4"],["31","32","8"]],"row_sums_preview":["1","1","11","71","481","3241","21851","147311"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A013609","x \u21a6 x+1"],"edges":["e-064ccd10ffc87509","e-19035e6825c5d565"],"text":"A035607 \u2192 basis A013609 \u2192 x \u21a6 x+1"},"headline":"A035607 \u2192 basis A013609 \u2192 x \u21a6 x+1","chain":null}}],"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:      1;\n  2:      7,       4;\n  3:     31,      32,       8;\n  4:    145,     216,     104,      16;\n  5:    673,    1312,     936,     288,      32;\n  6:   3127,    7532,    7112,    3280,     736,     64;\n  7:  14527,   41664,   48944,   30080,   10176,   1792,   128;\n  8:  67489,  224560,  315504,  242272,  109632,  29184,  4224,  256;\n  9: 313537, 1187264, 1941296, 1788224, 1013760, 361728, 79232, 9728, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+2*x)*P(n-2,x) + (4+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 2, x] + (4 + 2*x)*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] = 1; for(n = 2, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 2] + (4 + 2*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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A013609","basis A007318"],"edges":["e-064ccd10ffc87509","e-2c7a01782dad3994"],"text":"A035607 \u2192 basis A013609 \u2192 basis A007318"},"headline":"A035607 \u2192 basis A013609 \u2192 basis A007318","chain":null}