{"id":"n-383dbec4c7c95c13","revision":0,"first_index":0,"fingerprint":"f6-f7e540eff5cde790","name":"basis_map_A008277 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","248","64"],["341","704","192"],["1651","6216","3840","512"],["5061","21616","14464","2048"],["21571","146712","164032","50176","4096"],["72181","576288","713024","235520","20480"],["287891","3389672","6151552","3253760","593920","32768"],["1009701","14340304","29300480","16965632","3338240","196608"],["3888611","77657528","216358208","176805888","54312960","6586368","262144"],["13985621","343860608","1092893120","988041216","330244096","43122688","1835008"],["52871731","1772805000","7339466752","8730307072","4025835520","806944768","69730304","2097152"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","19","37","443","1237","12219","43189","386587","1617493","13709563","65150965","535871707","2813982357","22800058299"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","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":[["0","8"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196510,"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-0f80d520325d86ab"]},{"id":196511,"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-0f80d520325d86ab"]},{"id":196512,"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-0f80d520325d86ab"]}],"region_exact":{},"incoming_edges":[{"id":"e-0f80d520325d86ab","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-383dbec4c7c95c13","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"7216ba37b81d77713326e1edfd5958c0c9103ea6ddbbafcb1925751bcc6f8c88","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-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":[],"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,    248,     64;\n  5:   341,    704,    192;\n  6:  1651,   6216,   3840,    512;\n  7:  5061,  21616,  14464,   2048;\n  8: 21571, 146712, 164032,  50176,  4096;\n  9: 72181, 576288, 713024, 235520, 20480;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (10+8*x)*P(n-2,x) + 8*x*d/dx 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] + 8*x*D[P[n - 2, x], 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] + 8*x*deriv(v[i - 2], x) + 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 A008277"],"edges":["e-099e290d18ba9894","e-0f80d520325d86ab"],"text":"A128099 \u2192 basis A013611 \u2192 basis A008277"},"headline":"A128099 \u2192 basis A013611 \u2192 basis A008277","chain":null}