{"id":"n-f91986a1e2f81fd1","revision":1,"first_index":0,"fingerprint":"f6-97f0a8adbf46de41","name":"basis_map_A013611 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"],["3","8"],["7","32","32"],["17","112","224","128"],["41","352","1056","1280","512"],["99","1048","4192","7808","6656","2048"],["239","3008","15040","37888","50176","32768","8192"],["577","8416","50496","160512","289792","294912","155648","32768"],["1393","23104","161728","621056","1423360","1982464","1630208","720896","131072"],["3363","62504","500032","2251520","6262784","11112448","12525568","8617984","3276800","524288"],["8119","167136","1504224","7771136","25439232","54951936","79060992","74579968","44040192","14680064","2097152"],["19601","442704","4427040","25810816","97231872","247824384","434905088","524124160","424148992","219152384","65011712","8388608"],["47321","1163424","12797664","83117824","354230784","1041285120","2159976448","3178692608","3287154688","2325741568","1067450368","285212672","33554432"],["114243","3037240","36446880","260945280","1241408000","4136245248","9911296000","17261035520","21809725440","19715850240","12379488256","5108662272","1241513984","134217728"]],"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_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167713,"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-a3c2dcd265d17df4"]},{"id":167714,"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-a3c2dcd265d17df4"]},{"id":167715,"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-a3c2dcd265d17df4"]},{"id":167716,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-a3c2dcd265d17df4","e-e56c5f20febc18d7"]},{"id":167717,"position":4,"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-e56c5f20febc18d7"]},{"id":167718,"position":5,"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-e56c5f20febc18d7"]},{"id":167719,"position":6,"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-e56c5f20febc18d7"]}],"region_exact":{},"incoming_edges":[{"id":"e-a3c2dcd265d17df4","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-f91986a1e2f81fd1","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":"9524a2e5f17f270a11f126c4fe723e392ccd0044607c6845f0fe6ee68171d4d2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-a1540a6d32c29f8f","role":"sequence","name":"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]"}]},{"id":"e-e56c5f20febc18d7","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-f91986a1e2f81fd1","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":"e5a90192be0d7d9fa7a65ad10d5f71c7896d4d9fb68457f1a4323314f82436f0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-e073e5e0b021f36a","role":"sequence","name":"Table a(d,m) of number of points of L1 norm m in cubic lattice Z^d, read by antidiagonals (d >= 1, m >= 0).","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-f986d635f61233ba","kind":"oeis_match","node_a_id":"n-f91986a1e2f81fd1","node_b_id":null,"fingerprint":null,"oeis_id":"A123362","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A123362","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A123362","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-f91986a1e2f81fd1","oeis_id":"A123362","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":17357}],"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:    3,     8;\n  3:    7,    32,     32;\n  4:   17,   112,    224,    128;\n  5:   41,   352,   1056,   1280,     512;\n  6:   99,  1048,   4192,   7808,    6656,    2048;\n  7:  239,  3008,  15040,  37888,   50176,   32768,    8192;\n  8:  577,  8416,  50496, 160512,  289792,  294912,  155648,  32768;\n  9: 1393, 23104, 161728, 621056, 1423360, 1982464, 1630208, 720896, 131072;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+4*x)*P(n-2,x) + (2+4*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[(1 + 4*x)*P[n - 2, x] + (2 + 4*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] = (1 + 4*x)*v[i - 2] + (2 + 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 - 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 A013611"],"edges":["e-a3c2dcd265d17df4"],"text":"A266213 \u2192 basis A013611"},"headline":"A266213 \u2192 basis A013611","chain":null}