{"id":"n-28b4b73ea763f8fe","revision":0,"first_index":1,"fingerprint":"f6-97f0a8adbf46de41","name":"basis_map_A013611 of reversal of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.","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":1,"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":204436,"position":0,"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-08b184fbd7c4ef74"]},{"id":204437,"position":1,"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-08b184fbd7c4ef74"]},{"id":204438,"position":2,"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-08b184fbd7c4ef74"]},{"id":204439,"position":3,"claim":"interlacing","from_index":3,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":3,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 3","region_exact":null,"edges":["e-08b184fbd7c4ef74"]}],"region_exact":{},"incoming_edges":[{"id":"e-08b184fbd7c4ef74","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-28b4b73ea763f8fe","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":"b3517b287870b2b3de75c658f355a7cf7eb4166d9ed9585d6e0eb70a2f88cff1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":3,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-ed18eef7ee1e3954","role":"sequence","name":"reversal of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.","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-648bd67555466be3","kind":"fingerprint_related","node_a_id":"n-f91986a1e2f81fd1","node_b_id":"n-28b4b73ea763f8fe","fingerprint":"f6-97f0a8adbf46de41","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-97f0a8adbf46de41"},"other_id":"n-f91986a1e2f81fd1","other":{"id":"n-f91986a1e2f81fd1","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.","first_index":0,"fingerprint":"f6-97f0a8adbf46de41","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["3","8"]],"card_rows":[["1"],["1"],["3","8"],["7","32","32"]],"row_sums_preview":["1","1","11","71","481","3241","21851","147311"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A013611"],"edges":["e-8337e61ed504a271"],"text":"A035607 \u2192 basis A013611"},"headline":"A035607 \u2192 basis A013611","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:    1;\n   2:    1;\n   3:    3,     8;\n   4:    7,    32,     32;\n   5:   17,   112,    224,    128;\n   6:   41,   352,   1056,   1280,     512;\n   7:   99,  1048,   4192,   7808,    6656,    2048;\n   8:  239,  3008,  15040,  37888,   50176,   32768,    8192;\n   9:  577,  8416,  50496, 160512,  289792,  294912,  155648,  32768;\n  10: 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 >= 3, with P(1,x) = 1, P(2,x) = 1.","mathematica":"P[1, x_] := 1;\nP[2, 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, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); 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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-b0fc620949fb5990","steps":["reverse","basis A013611"],"edges":["e-0819b37fda6a96d6","e-08b184fbd7c4ef74"],"text":"A122542 \u2192 reverse \u2192 basis A013611"},"headline":"A122542 \u2192 reverse \u2192 basis A013611","chain":null}