{"id":"n-b74340a4f1cd3ad2","revision":0,"first_index":0,"fingerprint":"f6-c1122197787ef9b0","name":"basis_map_A007318 of basis_map_A013611 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 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"],["11","8"],["21","16"],["131","184","64"],["341","512","192"],["1651","3400","2304","512"],["5061","11248","8320","2048"],["21571","58456","58560","25600","4096"],["72181","211424","231744","112640","20480"],["287891","968552","1284992","837120","266240","32768"],["1009701","3660240","5293824","3817472","1372160","196608"],["3888611","15648888","25892160","22468608","10731520","2654208","262144"],["13985621","60328896","108112320","102993920","54992896","15597568","1835008"],["52871731","247926664","492225024","534817280","342056960","127991808","25690112","2097152"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","19","37","379","1045","7867","26677","168283","648469","3677563","15350005","81546139","357846229","1825676731"],"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":[["10","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195423,"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-69637a0f48d7969f"]},{"id":195424,"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-69637a0f48d7969f"]},{"id":195425,"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-69637a0f48d7969f"]},{"id":195426,"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-69637a0f48d7969f"]}],"region_exact":{},"incoming_edges":[{"id":"e-69637a0f48d7969f","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-b74340a4f1cd3ad2","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":"c00d1b3ffd60eb2d03a0068082acad6a7321eb7e86a464029da09b4de6ded14a","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-af7a69a897cce4e9","role":"sequence","name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 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-5562eb8f7260f804","kind":"candidate_equal","node_a_id":"n-81b00881f7f71483","node_b_id":"n-b74340a4f1cd3ad2","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-81b00881f7f71483","other":{"id":"n-81b00881f7f71483","name":"shift_x_plus_one of basis_map_A013611 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)).","first_index":0,"fingerprint":"f6-c1122197787ef9b0","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["11","8"]],"card_rows":[["1"],["1"],["11","8"],["21","16"]],"row_sums_preview":["1","1","19","37","379","1045","7867","26677"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e3d901814302c059","steps":["basis A013611","x \u21a6 x+1"],"edges":["e-099e290d18ba9894","e-6fce2e840d135f3d"],"text":"A128099 \u2192 basis A013611 \u2192 x \u21a6 x+1"},"headline":"A128099 \u2192 basis A013611 \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:    11,      8;\n  3:    21,     16;\n  4:   131,    184,     64;\n  5:   341,    512,    192;\n  6:  1651,   3400,   2304,    512;\n  7:  5061,  11248,   8320,   2048;\n  8: 21571,  58456,  58560,  25600,  4096;\n  9: 72181, 211424, 231744, 112640, 20480;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (10+8*x)*P(n-2,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[(10 + 8*x)*P[n - 2, 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] = (10 + 8*x)*v[i - 2] + 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-e3d901814302c059","steps":["basis A013611","basis A007318"],"edges":["e-099e290d18ba9894","e-69637a0f48d7969f"],"text":"A128099 \u2192 basis A013611 \u2192 basis A007318"},"headline":"A128099 \u2192 basis A013611 \u2192 basis A007318","chain":null}