{"id":"n-40ba0d1f2a40a97e","revision":2,"first_index":0,"fingerprint":"f6-5db7e795cb165ce2","name":"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.","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","2"],["7","8","2"],["17","28","14","2"],["41","88","66","20","2"],["99","262","262","122","26","2"],["239","752","940","592","196","32","2"],["577","2104","3156","2508","1132","288","38","2"],["1393","5776","10108","9704","5560","1936","398","44","2"],["3363","15626","31252","35180","24464","10852","3058","526","50","2"],["8119","41784","94014","121424","99372","53664","19302","4552","672","56","2"],["19601","110676","276690","403294","379812","242016","106178","31990","6472","836","62","2"],["47321","290856","799854","1298716","1383714","1016880","527338","194012","50158","8872","1018","68","2"],["114243","759310","2277930","4077270","4849250","4039302","2419750","1053530","332790","75210","11806","1218","74","2"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","5","17","61","217","773","2753","9805","34921","124373","442961","1577629","5618809","20011685"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2"],["-5"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["20","23","4"],["-8","-8","-1"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["8","16","9","1"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161301,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-5cc1f9826e25e5f1"]},{"id":161302,"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-5cc1f9826e25e5f1"]},{"id":161303,"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-5cc1f9826e25e5f1"]},{"id":161304,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-15636530e2574f08","e-5cc1f9826e25e5f1"]},{"id":161305,"position":4,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-15636530e2574f08"]},{"id":161306,"position":5,"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-15636530e2574f08"]},{"id":161307,"position":6,"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-15636530e2574f08"]}],"region_exact":{},"incoming_edges":[{"id":"e-15636530e2574f08","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-40ba0d1f2a40a97e","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"27dd95e0d3ee68ca2377ad94b64a40beb3c6284d7254f84ecd2ef87ced932679","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-e073e5e0b021f36a","role":"sequence","name":"Table a(d,m) of number of points of L1 norm m in cubic lattice Z^d, read by antidiagonals (d >= 1, m >= 0).","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]"}]},{"id":"e-5cc1f9826e25e5f1","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-40ba0d1f2a40a97e","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"e00732edf6e65cc089e64e3ee074b4435fa8d36b8310e3628d3cad56be9a48fe","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-a1540a6d32c29f8f","role":"sequence","name":"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-824b5d91243aa240","kind":"candidate_equal","node_a_id":"n-40ba0d1f2a40a97e","node_b_id":"n-9ac33c0e4aa39b7d","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-9ac33c0e4aa39b7d","other":{"id":"n-9ac33c0e4aa39b7d","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.","first_index":0,"fingerprint":"f6-5db7e795cb165ce2","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["3","2"]],"card_rows":[["1"],["1"],["3","2"],["7","8","2"]],"row_sums_preview":["1","1","5","17","61","217","773","2753"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A007318"],"edges":["e-017120e86183432c"],"text":"A035607 \u2192 basis A007318"},"headline":"A035607 \u2192 basis A007318","chain":null}},{"id":"l-4663c208642eca67","kind":"fingerprint_related","node_a_id":"n-40ba0d1f2a40a97e","node_b_id":"n-4a65bf6e6040840d","fingerprint":"f6-5db7e795cb165ce2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5db7e795cb165ce2"},"other_id":"n-4a65bf6e6040840d","other":{"id":"n-4a65bf6e6040840d","name":"mobius_x_over_x_plus_one 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.","first_index":1,"fingerprint":"f6-5db7e795cb165ce2","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","2","3"]],"card_rows":[["1"],["0","1"],["0","2","3"],["0","2","8","7"]],"row_sums_preview":["1","1","5","17","61","217","773","2753"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b0fc620949fb5990","steps":["x \u21a6 x/(x+1)"],"edges":["e-217dc49de8a7d573"],"text":"A122542 \u2192 x \u21a6 x/(x+1)"},"headline":"A122542 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-fabdc6742d15f374","kind":"fingerprint_related","node_a_id":"n-40ba0d1f2a40a97e","node_b_id":"n-7e0e00e3b41ff4d0","fingerprint":"f6-5db7e795cb165ce2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5db7e795cb165ce2"},"other_id":"n-7e0e00e3b41ff4d0","other":{"id":"n-7e0e00e3b41ff4d0","name":"mobius_x_over_x_plus_one of A Riordan array of coordination sequences.","first_index":0,"fingerprint":"f6-5db7e795cb165ce2","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","3"],["2","8","7"]],"card_rows":[["1"],["2","3"],["2","8","7"],["2","14","28","17"]],"row_sums_preview":["1","5","17","61","217","773","2753","9805"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ec35d1145e9a1211","steps":["x \u21a6 x/(x+1)"],"edges":["e-73b4fdfae3fbc1a0"],"text":"A113413 \u2192 x \u21a6 x/(x+1)"},"headline":"A113413 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-a9fa57663064ad74","kind":"oeis_match","node_a_id":"n-40ba0d1f2a40a97e","node_b_id":null,"fingerprint":null,"oeis_id":"A007483","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A007483","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A007483","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-40ba0d1f2a40a97e","oeis_id":"A007483","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":27,"oeis_terms_available":27,"term_count":200,"raw_size":11993}],"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:    3,    2;\n  3:    7,    8,     2;\n  4:   17,   28,    14,    2;\n  5:   41,   88,    66,   20,    2;\n  6:   99,  262,   262,  122,   26,    2;\n  7:  239,  752,   940,  592,  196,   32,   2;\n  8:  577, 2104,  3156, 2508, 1132,  288,  38,  2;\n  9: 1393, 5776, 10108, 9704, 5560, 1936, 398, 44, 2;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (2*n^2-5*n+2)*P(n-1,x) - (8*n-20+(8*n-23)*x+(n-4)*x^2)*d/dx P(n-1,x) + (8+16*x+9*x^2+x^3)*d^2/dx^2 P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 3 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 3 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 5*n + 2)*P[n - 1, x] - (8*n - 20 + (8*n - 23)*x + (n - 4)*x^2)*D[P[n - 1, x], x] + (8 + 16*x + 9*x^2 + x^3)*D[P[n - 1, x], {x, 2}])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; v[3] = 3 + 2*x; for(n = 3, N, my(i = n + 1); v[i] = ((2*n^2 - 5*n + 2)*v[i - 1] - (8*n - 20 + (8*n - 23)*x + (n - 4)*x^2)*deriv(v[i - 1], x) + (8 + 16*x + 9*x^2 + x^3)*deriv(deriv(v[i - 1], x), x))/(n - 2)); 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":["x \u21a6 x+1"],"edges":["e-15636530e2574f08"],"text":"A035607 \u2192 x \u21a6 x+1"},"headline":"A035607 \u2192 x \u21a6 x+1","chain":null}