{"id":"n-45d316ccbe3d57d1","revision":1,"first_index":0,"fingerprint":"f6-9740049352638c67","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.","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","4"],["7","16","8"],["17","56","56","16"],["41","176","264","160","32"],["99","524","1048","976","416","64"],["239","1504","3760","4736","3136","1024","128"],["577","4208","12624","20064","18112","9216","2432","256"],["1393","11552","40432","77632","88960","61952","25472","5632","512"],["3363","31252","125008","281440","391424","347264","195712","67328","12800","1024"],["8119","83568","376056","971392","1589952","1717248","1235328","582656","172032","28672","2048"],["19601","221352","1106760","3226352","6076992","7744512","6795392","4094720","1656832","428032","63488","4096"],["47321","581712","3199416","10389728","22139424","32540160","33749632","24833536","12840448","4542464","1042432","139264","8192"],["114243","1518620","9111720","32618160","77588000","129257664","154864000","134851840","85194240","38507520","12089344","2494464","303104","16384"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","7","31","145","673","3127","14527","67489","313537","1456615","6767071","31438129","146053729","678529303"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":166333,"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-c48c00981e95a888"]},{"id":166334,"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-c48c00981e95a888"]},{"id":166335,"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-c48c00981e95a888"]},{"id":166336,"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-6f8f85b50ad1138b","e-c48c00981e95a888"]},{"id":166337,"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-6f8f85b50ad1138b"]},{"id":166338,"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-6f8f85b50ad1138b"]},{"id":166339,"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-6f8f85b50ad1138b"]}],"region_exact":{},"incoming_edges":[{"id":"e-6f8f85b50ad1138b","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-45d316ccbe3d57d1","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":"7c2acbbb968417ecbfec58f194597dbfaf5c31367480422cccbe381af41ae9de","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]"}]},{"id":"e-c48c00981e95a888","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-45d316ccbe3d57d1","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":"b6ce81e4cc50c661cbef9326f1bbc5212d2d7eaa5920c44fdf30fcf4e6f22c52","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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-4d1d5b18a5667734","kind":"oeis_match","node_a_id":"n-45d316ccbe3d57d1","node_b_id":null,"fingerprint":null,"oeis_id":"A086901","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A086901","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A086901","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-45d316ccbe3d57d1","oeis_id":"A086901","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":14160}],"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,     4;\n  3:    7,    16,     8;\n  4:   17,    56,    56,    16;\n  5:   41,   176,   264,   160,    32;\n  6:   99,   524,  1048,   976,   416,    64;\n  7:  239,  1504,  3760,  4736,  3136,  1024,   128;\n  8:  577,  4208, 12624, 20064, 18112,  9216,  2432,  256;\n  9: 1393, 11552, 40432, 77632, 88960, 61952, 25472, 5632, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*x)*P(n-2,x) + (2+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[(1 + 2*x)*P[n - 2, x] + (2 + 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] = (1 + 2*x)*v[i - 2] + (2 + 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"],"edges":["e-6f8f85b50ad1138b"],"text":"A035607 \u2192 basis A013609"},"headline":"A035607 \u2192 basis A013609","chain":null}