{"id":"n-2d50b896af216f8a","revision":0,"first_index":0,"fingerprint":"f6-b900c65c06c92dda","name":"basis_map_A013611 of basis_map_A013609 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"],["7","16"],["13","32"],["55","240","256"],["133","640","768"],["463","2960","6144","4096"],["1261","8928","20992","16384"],["4039","34096","105216","139264","65536"],["11605","107840","374016","573440","327680"],["35839","377040","1550848","3092480","2949120","1048576"],["105469","1209760","5520384","12517376","14090240","6291456"],["320503","4045424","20858112","55885824","81264640","59768832","16777216"],["953317","12991488","73336576","219316224","366084096","322961408","117440512"],["2876335","42392080","263212032","888360960","1747845120","1981808640","1174405120","268435456"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","23","45","551","1541","13663","47565","348151","1394581","9053903","39734685","238920551","1113083621","6369335743"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["6","16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204661,"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-3302b224a937fa25"]},{"id":204662,"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-3302b224a937fa25"]},{"id":204663,"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-3302b224a937fa25"]},{"id":204664,"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-3302b224a937fa25"]}],"region_exact":{},"incoming_edges":[{"id":"e-3302b224a937fa25","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-2d50b896af216f8a","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":"57ed70bd2110370dfaed135b05ed5f25f95196a9e2ff9154a02869e00509b34d","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-9e53622e0c440ce5","role":"sequence","name":"basis_map_A013609 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":[],"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:     7,     16;\n  3:    13,     32;\n  4:    55,    240,    256;\n  5:   133,    640,    768;\n  6:   463,   2960,   6144,   4096;\n  7:  1261,   8928,  20992,  16384;\n  8:  4039,  34096, 105216, 139264,  65536;\n  9: 11605, 107840, 374016, 573440, 327680;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (6+16*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[(6 + 16*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] = (6 + 16*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 A013609","basis A013611"],"edges":["e-2ee1895757bd17cf","e-3302b224a937fa25"],"text":"A128099 \u2192 basis A013609 \u2192 basis A013611"},"headline":"A128099 \u2192 basis A013609 \u2192 basis A013611","chain":null}