{"id":"n-b5ebaf3676d81658","revision":1,"first_index":0,"fingerprint":"f6-6cc4c3f8304d4d17","name":"basis_map_A013610 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","3"],["5","6"],["11","21","9"],["21","48","27"],["43","123","108","27"],["85","282","306","108"],["171","657","891","486","81"],["341","1476","2349","1620","405"],["683","3303","6102","5265","2025","243"],["1365","7278","15228","15552","7695","1458"],["2731","15933","37341","44388","27540","8019","729"],["5461","34584","89631","121176","89586","34020","5103"],["10923","74643","212112","321975","277830","132678","30618","2187"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","6","11","41","96","301","781","2286","6191","17621","48576","136681","379561","1062966"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":166992,"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-f721257c9beb3a40"]},{"id":166993,"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-f721257c9beb3a40"]},{"id":166994,"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-f721257c9beb3a40"]}],"region_exact":{},"incoming_edges":[{"id":"e-f721257c9beb3a40","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-b5ebaf3676d81658","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":"20b94261ba7e4274c62d88e834c6de97a07bbede25e04173da87e3004028b6d2","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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-6c72593f7afc84a4","kind":"oeis_match","node_a_id":"n-b5ebaf3676d81658","node_b_id":null,"fingerprint":null,"oeis_id":"A015440","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":"A015440","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A015440","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-b5ebaf3676d81658","oeis_id":"A015440","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":200,"raw_size":9820}],"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,    3;\n  3:   5,    6;\n  4:  11,   21,    9;\n  5:  21,   48,   27;\n  6:  43,  123,  108,   27;\n  7:  85,  282,  306,  108;\n  8: 171,  657,  891,  486,  81;\n  9: 341, 1476, 2349, 1620, 405;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+3*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[(2 + 3*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] = (2 + 3*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-75ccd0453a9b6cec","steps":["basis A007318","basis A013610"],"edges":["e-2a29a8b9938e2bd7","e-f721257c9beb3a40"],"text":"A011973 \u2192 basis A007318 \u2192 basis A013610"},"headline":"A011973 \u2192 basis A007318 \u2192 basis A013610","chain":null}