{"id":"n-d7889f3e929cbf0f","revision":0,"first_index":0,"fingerprint":"f6-5d09cadc540fdad8","name":"basis_map_A007318 of basis_map_A013610 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"],["9","6"],["49","60","18"],["281","498","288","54"],["1601","3720","3186","1188","162"],["9129","26238","29736","16578","4536","486"],["52049","178260","251298","186408","76626","16524","1458"],["296761","1179786","1988928","1841454","1010232","328050","58320","4374"],["1692001","7658400","15023970","16673580","11441250","4966920","1331154","201204","13122"],["9647049","48977430","109590120","141772410","116792280","63501246","22773960","5191938","682344","39366"],["55003249","309537900","777953970","1149398640","1105064370","722074500","324598914","99079848","19643634","2283228","118098"],["313604441","1937550114","5403676320","8976715110","9866004120","7529947434","4070817648","1558285614","413762904","72551538","7558272","354294"],["1788035201","12031725240","36871461522","68026060980","84128619330","73451240640","46408549698","21373997148","7119485442","1672110216","262768050","24800580","1062882"],["10194593769","74213745582","247879838952","502862578866","691115441400","679359863286","491269583304","264541230234","106049327112","31250502270","6578058600","936399042","80779032","3188646"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","15","127","1121","9857","86703","762623","6707905","59001601","518968143","4564756351","40150827809","353159916929","3106335130095"],"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":[["4","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["5","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195475,"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-f5aea093eebe3c01"]},{"id":195476,"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-f5aea093eebe3c01"]},{"id":195477,"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-f5aea093eebe3c01"]},{"id":195478,"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-f5aea093eebe3c01"]}],"region_exact":{},"incoming_edges":[{"id":"e-f5aea093eebe3c01","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-d7889f3e929cbf0f","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":"86bfa33d61ac41c83ef77e1f32b1c708dee899cf86c031218088a80a1c68fae8","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-4246e71c9dd6d2b5","role":"sequence","name":"basis_map_A013610 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-8c81eef5943e337d","kind":"candidate_equal","node_a_id":"n-594bbffcdc3fa5ea","node_b_id":"n-d7889f3e929cbf0f","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-594bbffcdc3fa5ea","other":{"id":"n-594bbffcdc3fa5ea","name":"shift_x_plus_one of basis_map_A013610 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-5d09cadc540fdad8","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["9","6"]],"card_rows":[["1"],["1"],["9","6"],["49","60","18"]],"row_sums_preview":["1","1","15","127","1121","9857","86703","762623"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-a1540a6d32c29f8f","steps":["basis A013610","x \u21a6 x+1"],"edges":["e-251e56a692041c9f","e-c410a80057ced902"],"text":"A266213 \u2192 basis A013610 \u2192 x \u21a6 x+1"},"headline":"A266213 \u2192 basis A013610 \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:       9,       6;\n  3:      49,      60,       18;\n  4:     281,     498,      288,       54;\n  5:    1601,    3720,     3186,     1188,      162;\n  6:    9129,   26238,    29736,    16578,     4536,     486;\n  7:   52049,  178260,   251298,   186408,    76626,   16524,    1458;\n  8:  296761, 1179786,  1988928,  1841454,  1010232,  328050,   58320,   4374;\n  9: 1692001, 7658400, 15023970, 16673580, 11441250, 4966920, 1331154, 201204, 13122;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4+3*x)*P(n-2,x) + (5+3*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[(4 + 3*x)*P[n - 2, x] + (5 + 3*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] = (4 + 3*x)*v[i - 2] + (5 + 3*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-a1540a6d32c29f8f","steps":["basis A013610","basis A007318"],"edges":["e-251e56a692041c9f","e-f5aea093eebe3c01"],"text":"A266213 \u2192 basis A013610 \u2192 basis A007318"},"headline":"A266213 \u2192 basis A013610 \u2192 basis A007318","chain":null}