{"id":"n-d465d6a5ebc6ced7","revision":0,"first_index":0,"fingerprint":"f6-48a53241c969ef5c","name":"basis_map_A007318 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","2"],["17","12","2"],["61","62","20","2"],["217","288","138","28","2"],["773","1266","804","246","36","2"],["2753","5364","4242","1736","386","44","2"],["9805","22150","20964","10746","3212","558","52","2"],["34921","89736","98890","60916","22890","5360","762","60","2"],["124373","358234","450484","324094","146756","43298","8308","998","68","2"],["442961","1413468","1997202","1643488","871058","310260","75106","12184","1266","76","2"],["1577629","5524206","8664276","8026338","4874268","2035190","595492","121962","17116","1566","84","2"],["5618809","21420144","36924906","38027468","26034746","12471416","4282138","1060852","188026","23232","1898","92","2"],["20011685","82505282","155047620","175724262","133906580","72393642","28544004","8304110","1781124","277970","30660","2262","100","2"]],"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_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195378,"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-4e33b7f82e7c19e2"]},{"id":195379,"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-4e33b7f82e7c19e2"]},{"id":195380,"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-4e33b7f82e7c19e2"]},{"id":195381,"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-4e33b7f82e7c19e2"]}],"region_exact":{},"incoming_edges":[{"id":"e-4e33b7f82e7c19e2","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-d465d6a5ebc6ced7","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":"b0dede5ee1e917bf388b49b255784ce5ac042affa68263704e2491f6fe68c52c","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-9d087513db99e358","kind":"candidate_equal","node_a_id":"n-d87adca1089fcb13","node_b_id":"n-d465d6a5ebc6ced7","fingerprint":null,"oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"reason":"no all-index equality certificate was found","rows_compared":15},"other_id":"n-d87adca1089fcb13","other":{"id":"n-d87adca1089fcb13","name":"shift_x_plus_one of shift_x_plus_one 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-48a53241c969ef5c","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["5","2"]],"card_rows":[["1"],["1"],["5","2"],["17","12","2"]],"row_sums_preview":["1","1","7","31","145","673","3127","14527"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A007318","x \u21a6 x+1"],"edges":["e-017120e86183432c","e-c421fc13c16faa33"],"text":"A035607 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A035607 \u2192 basis A007318 \u2192 x \u21a6 x+1","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,     2;\n  3:    17,    12,     2;\n  4:    61,    62,    20,     2;\n  5:   217,   288,   138,    28,     2;\n  6:   773,  1266,   804,   246,    36,    2;\n  7:  2753,  5364,  4242,  1736,   386,   44,   2;\n  8:  9805, 22150, 20964, 10746,  3212,  558,  52,  2;\n  9: 34921, 89736, 98890, 60916, 22890, 5360, 762, 60, 2;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+x)*P(n-2,x) + (3+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 + x)*P[n - 2, x] + (3 + 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 + x)*v[i - 2] + (3 + 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 A007318"],"edges":["e-017120e86183432c","e-4e33b7f82e7c19e2"],"text":"A035607 \u2192 basis A007318 \u2192 basis A007318"},"headline":"A035607 \u2192 basis A007318 \u2192 basis A007318","chain":null}