{"id":"n-6525e1ea039a2abd","revision":0,"first_index":0,"fingerprint":"f6-f306fd380fd70a6b","name":"basis_map_A013609 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","8"],["31","64","32"],["145","432","416","128"],["673","2624","3744","2304","512"],["3127","15064","28448","26240","11776","2048"],["14527","83328","195776","240640","162816","57344","8192"],["67489","449120","1262016","1938176","1754112","933888","270336","32768"],["313537","2374528","7765184","14305792","16220160","11575296","5070848","1245184","131072"],["1456615","12369576","46141376","99146496","135118848","120999936","71131136","26443776","5636096","524288"],["6767071","63682496","266837472","655129600","1042945024","1124081664","830038016","414318592","133693440","25165824","2097152"],["31438129","324733456","1509982304","4169873280","7594241024","9571581952","8513871872","5341282304","2314731520","659554304","111149056","8388608"],["146053729","1642802112","8394105440","25752161024","52805810688","76207316992","79328256000","59983724544","32682409984","12507414528","3189768192","486539264","33554432"],["678529303","8255376248","45976510944","155134614912","353694103040","575144220672","685970235392","607327256576","398973861888","191996887040","65760395264","15174991872","2113929216","134217728"]],"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_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199410,"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-ea9c2a16f376cbff"]},{"id":199411,"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-ea9c2a16f376cbff"]},{"id":199412,"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-ea9c2a16f376cbff"]},{"id":199413,"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-ea9c2a16f376cbff"]}],"region_exact":{},"incoming_edges":[{"id":"e-ea9c2a16f376cbff","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-6525e1ea039a2abd","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":"8349a7d5d4ed11d649babf768acb2942fcb9ac6ef508b7f1977ac1a6876423e7","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":[],"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,       8;\n  3:     31,      64,      32;\n  4:    145,     432,     416,      128;\n  5:    673,    2624,    3744,     2304,      512;\n  6:   3127,   15064,   28448,    26240,    11776,     2048;\n  7:  14527,   83328,  195776,   240640,   162816,    57344,    8192;\n  8:  67489,  449120, 1262016,  1938176,  1754112,   933888,  270336,   32768;\n  9: 313537, 2374528, 7765184, 14305792, 16220160, 11575296, 5070848, 1245184, 131072;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+4*x)*P(n-2,x) + (4+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[(3 + 4*x)*P[n - 2, x] + (4 + 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] = (3 + 4*x)*v[i - 2] + (4 + 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 A013609","basis A013609"],"edges":["e-064ccd10ffc87509","e-ea9c2a16f376cbff"],"text":"A035607 \u2192 basis A013609 \u2192 basis A013609"},"headline":"A035607 \u2192 basis A013609 \u2192 basis A013609","chain":null}
