{"id":"n-4fbbd06a79f82b4b","revision":0,"first_index":0,"fingerprint":"f6-8440005d8db29c5d","name":"basis_map_A013611 of basis_map_A007318 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"],["5","8"],["17","48","32"],["61","248","320","128"],["217","1152","2208","1792","512"],["773","5064","12864","15744","9216","2048"],["2753","21456","67872","111104","98816","45056","8192"],["9805","88600","335424","687744","822272","571392","212992","32768"],["34921","358944","1582240","3898624","5859840","5488640","3121152","983040","131072"],["124373","1432936","7207744","20742016","37569536","44337152","34029568","16351232","4456448","524288"],["442961","5653872","31955232","105183232","222990848","317706240","307634176","199622656","82968576","19922944","2097152"],["1577629","22096824","138628416","513685632","1247812608","2084034560","2439135232","1998225408","1121714176","410517504","88080384","8388608"],["5618809","85680576","590798496","2433757952","6664894976","12770729984","17539637248","17380999168","12322471936","6090129408","1990197248","385875968","33554432"],["20011685","330021128","2480761920","11246352768","34280084480","74131089408","116916240384","136054538240","116727742464","72868167680","32149340160","9487515648","1677721600","134217728"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","13","97","757","5881","45709","355249","2760997","21458473","166775293","1296177889","10073896981","78294346201","608503805293"],"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":[["2","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204749,"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-a6ec54cd798709b8"]},{"id":204750,"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-a6ec54cd798709b8"]},{"id":204751,"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-a6ec54cd798709b8"]},{"id":204752,"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-a6ec54cd798709b8"]}],"region_exact":{},"incoming_edges":[{"id":"e-a6ec54cd798709b8","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-4fbbd06a79f82b4b","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":"ba390ed33f1b876f4963354b2536f873024c4f1e5889b83e4a75f70ae2702962","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-9ac33c0e4aa39b7d","role":"sequence","name":"basis_map_A007318 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-54b820269192eaf2","kind":"fingerprint_related","node_a_id":"n-2c05d405bf11a63b","node_b_id":"n-4fbbd06a79f82b4b","fingerprint":"f6-8440005d8db29c5d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8440005d8db29c5d"},"other_id":"n-2c05d405bf11a63b","other":{"id":"n-2c05d405bf11a63b","name":"basis_map_A013609 of Triangular array:  row n gives the coefficients of the polynomial p(n,x) defined in Comments.","first_index":0,"fingerprint":"f6-8440005d8db29c5d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["5","8"],["17","48","32"]],"card_rows":[["1"],["5","8"],["17","48","32"],["61","248","320","128"]],"row_sums_preview":["1","13","97","757","5881","45709","355249","2760997"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e646c30d067149e7","steps":["basis A013609"],"edges":["e-a770c5ffc0a77277"],"text":"A249252 \u2192 basis A013609"},"headline":"A249252 \u2192 basis A013609","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:     5,      8;\n  3:    17,     48,      32;\n  4:    61,    248,     320,     128;\n  5:   217,   1152,    2208,    1792,     512;\n  6:   773,   5064,   12864,   15744,    9216,    2048;\n  7:  2753,  21456,   67872,  111104,   98816,   45056,    8192;\n  8:  9805,  88600,  335424,  687744,  822272,  571392,  212992,  32768;\n  9: 34921, 358944, 1582240, 3898624, 5859840, 5488640, 3121152, 983040, 131072;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+4*x)*P(n-2,x) + (3+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[(2 + 4*x)*P[n - 2, x] + (3 + 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] = (2 + 4*x)*v[i - 2] + (3 + 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-e073e5e0b021f36a","steps":["basis A007318","basis A013611"],"edges":["e-017120e86183432c","e-a6ec54cd798709b8"],"text":"A035607 \u2192 basis A007318 \u2192 basis A013611"},"headline":"A035607 \u2192 basis A007318 \u2192 basis A013611","chain":null}
