{"id":"n-fe5f0667f4ce56c9","revision":1,"first_index":0,"fingerprint":"f6-3d8013fbbe82cb22","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["3","1"],["5","2"],["11","7","1"],["21","16","3"],["43","41","12","1"],["85","94","34","4"],["171","219","99","18","1"],["341","492","261","60","5"],["683","1101","678","195","25","1"],["1365","2426","1692","576","95","6"],["2731","5311","4149","1644","340","33","1"],["5461","11528","9959","4488","1106","140","7"],["10923","24881","23568","11925","3430","546","42","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","4","7","19","40","97","217","508","1159","2683","6160","14209","32689","75316"],"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"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-2"],["5","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-18","-17","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":"e-c2621fb6b5bc9d56","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161091,"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-6b0b885431c4352b"]},{"id":161092,"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-6b0b885431c4352b","e-c1bb5e4df6e83fab"]},{"id":161093,"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-6b0b885431c4352b","e-c1bb5e4df6e83fab"]},{"id":161094,"position":3,"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-c1bb5e4df6e83fab"]}],"region_exact":{},"incoming_edges":[{"id":"e-c1bb5e4df6e83fab","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-fe5f0667f4ce56c9","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":"54f10d655d57d538878811172da616514790ec41c48dbe4b4b8ba29fc9660697","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-7d332fcb7bf9a0f7","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","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]"}]},{"id":"e-c2621fb6b5bc9d56","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-fe5f0667f4ce56c9","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"c72ab902dd9f2a8bc8f309d2a1f2682eb30b831f5848b6fda29cd9610d933ee1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-6b0b885431c4352b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-fe5f0667f4ce56c9","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":"789fc54cca1cd2c05cffb1a3fff0ab2cb479232468ee34be9640ad5fd617d28b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-7d332fcb7bf9a0f7","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","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-5afc3668ab8b26eb","kind":"fingerprint_related","node_a_id":"n-ac04e52510a48bb5","node_b_id":"n-fe5f0667f4ce56c9","fingerprint":"f6-3d8013fbbe82cb22","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d8013fbbe82cb22"},"other_id":"n-ac04e52510a48bb5","other":{"id":"n-ac04e52510a48bb5","name":"Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.","first_index":0,"fingerprint":"f6-3d8013fbbe82cb22","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","1"],["5","2"]],"card_rows":[["1"],["3","1"],["5","2"],["11","7","1"]],"row_sums_preview":["1","4","7","19","40","97","217","508"],"regions":["(-inf, -2]"],"region_exact":{},"oeis_ids":["A249139"],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["x \u21a6 x+2 (shift +1)"],"edges":["e-7fc1b55fb0aa373a"],"text":"A011973 \u2192 x \u21a6 x+2 (shift +1)"},"headline":"A249139: Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.","chain":"A011973 \u2192 x \u21a6 x+2 (shift +1)"}},{"id":"l-a83f6093cbe7dc7f","kind":"oeis_match","node_a_id":"n-fe5f0667f4ce56c9","node_b_id":null,"fingerprint":null,"oeis_id":"A006130","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A006130","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e8e70d8be8e1bbe6","kind":"oeis_match","node_a_id":"n-fe5f0667f4ce56c9","node_b_id":null,"fingerprint":null,"oeis_id":"A249139","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":13,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":13,"target":"triangle","terms_compared":57},"in_catalog":true,"oeis_id":"A249139","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A006130","relation":"match_row_sums"},{"oeis_id":"A249139","relation":"match_triangle"}],"bfiles":[{"node_id":"n-fe5f0667f4ce56c9","oeis_id":"A006130","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":33,"oeis_terms_available":33,"term_count":200,"raw_size":8160},{"node_id":"n-fe5f0667f4ce56c9","oeis_id":"A249139","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":61,"terms_matched":57,"oeis_terms_agreeing":57,"oeis_terms_available":57,"term_count":991,"raw_size":15661}],"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,   1;\n  3:   5,   2;\n  4:  11,   7,   1;\n  5:  21,  16,   3;\n  6:  43,  41,  12,  1;\n  7:  85,  94,  34,  4;\n  8: 171, 219,  99, 18, 1;\n  9: 341, 492, 261, 60, 5;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (5*n-4+(2*n-2)*x)*P(n-1,x) - (18+17*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n - 4 + (2*n - 2)*x)*P[n - 1, x] - (18 + 17*x + 4*x^2)*D[P[n - 1, x], x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((5*n - 4 + (2*n - 2)*x)*v[i - 1] - (18 + 17*x + 4*x^2)*deriv(v[i - 1], x))/(n)); 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}},{"oeis_id":"A249139","target":"triangle","first_row":1,"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:   3,    1;\n  2:   5,    2;\n  3:  11,    7,   1;\n  4:  21,   16,   3;\n  5:  43,   41,  12,   1;\n  6:  85,   94,  34,   4;\n  7: 171,  219,  99,  18,  1;\n  8: 341,  492, 261,  60,  5;\n  9: 683, 1101, 678, 195, 25, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (5*n+1+2*n*x)*P(n-1,x) - (18+17*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n + 1 + 2*n*x)*P[n - 1, x] - (18 + 17*x + 4*x^2)*D[P[n - 1, x], x])/(n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((5*n + 1 + 2*n*x)*v[i - 1] - (18 + 17*x + 4*x^2)*deriv(v[i - 1], x))/(n + 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":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["basis A007318","x \u21a6 x+1"],"edges":["e-2a29a8b9938e2bd7","e-6b0b885431c4352b"],"text":"A011973 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A011973 \u2192 basis A007318 \u2192 x \u21a6 x+1","chain":null}