{"id":"n-27bf97107a5d1d01","revision":0,"first_index":0,"fingerprint":"f6-d98b13d07e12b38e","name":"basis_map_A013609 of 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"],["11","16"],["71","192","128"],["481","1888","2432","1024"],["3241","16704","31872","26624","8192"],["21851","139440","352128","439296","270336","65536"],["147311","1120896","3521280","5840896","5390336","2621440","524288"],["993121","8775872","32971008","68229120","83935232","61341696","24641536","4194304"],["6695281","67383168","294606592","730517504","1123123200","1095761920","662175744","226492416","33554432"],["45137291","509685584","2541766912","7344871424","13548388352","16537747456","13353091072","6874464256","2046820352","268435456"],["304300151","3809689920","21340184448","70412804096","151509057536","222077386752","224497500160","154501382144","69256347648","18253611008","2147483648"],["2051487361","28202066976","175304945280","650256792576","1598857691136","2735612624896","3322671529984","2864185344000","1716778958848","681289187328","161061273600","17179869184"],["13830424921","207107151552","1414624649088","5826765813760","16116048207872","31526996672512","44720036773888","46334971215872","34796449300480","18467285630976","6573447446528","1408749273088","137438953472"],["93239986331","1510708542448","11246746369152","50931315600384","156506758553600","344559290351616","559034452672512","676672420446208","610955843076096","406315985797120","193434589593600","62414464745472","12232066859008","1099511627776"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","27","391","5825","86633","1288587","19166447","285081889","4240310257","63070408155","938109747511","13953451771169","207543751514009","3087007394221323"],"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":[["5","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199943,"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-69bb8ac5e942d52e"]},{"id":199944,"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-69bb8ac5e942d52e"]},{"id":199945,"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-69bb8ac5e942d52e"]},{"id":199946,"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-69bb8ac5e942d52e"]}],"region_exact":{},"incoming_edges":[{"id":"e-69bb8ac5e942d52e","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-27bf97107a5d1d01","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":"38f220728a465197f1a2ea50a76cef78677edf8fbad8bf74bbeebd5aac579a3d","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-f91986a1e2f81fd1","role":"sequence","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.","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:      11,       16;\n  3:      71,      192,       128;\n  4:     481,     1888,      2432,      1024;\n  5:    3241,    16704,     31872,     26624,       8192;\n  6:   21851,   139440,    352128,    439296,     270336,      65536;\n  7:  147311,  1120896,   3521280,   5840896,    5390336,    2621440,    524288;\n  8:  993121,  8775872,  32971008,  68229120,   83935232,   61341696,  24641536,   4194304;\n  9: 6695281, 67383168, 294606592, 730517504, 1123123200, 1095761920, 662175744, 226492416, 33554432;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (5+8*x)*P(n-2,x) + (6+8*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[(5 + 8*x)*P[n - 2, x] + (6 + 8*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] = (5 + 8*x)*v[i - 2] + (6 + 8*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 A013611","basis A013609"],"edges":["e-8337e61ed504a271","e-69bb8ac5e942d52e"],"text":"A035607 \u2192 basis A013611 \u2192 basis A013609"},"headline":"A035607 \u2192 basis A013611 \u2192 basis A013609","chain":null}