{"id":"n-708c2ef04340154f","revision":1,"first_index":0,"fingerprint":"f6-94fea6e215d8895c","name":"theta_plus_one 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"],["1","4"],["1","8"],["1","12","12"],["1","16","36"],["1","20","72","32"],["1","24","120","128"],["1","28","180","320","80"],["1","32","252","640","400"],["1","36","336","1120","1200","192"],["1","40","432","1792","2800","1152"],["1","44","540","2688","5600","4032","448"],["1","48","660","3840","10080","10752","3136"],["1","52","792","5280","16800","24192","12544","1024"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","5","9","25","53","125","273","609","1325","2885","6217","13353","28517","60685"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["1","0"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-16"],["1","8","8"],["0","2","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-12","-32"],["0","0","-2","-16"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161173,"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-f7d8bf11b8c8ed69"]},{"id":161174,"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-f7d8bf11b8c8ed69"]},{"id":161175,"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-f7d8bf11b8c8ed69"]}],"region_exact":{},"incoming_edges":[{"id":"e-f7d8bf11b8c8ed69","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-708c2ef04340154f","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"b53fa2a32106e582438561994cf7e8ffa287cff25de0cd5846e10c559a1ffcf3","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-e3d901814302c059","role":"sequence","name":"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-936b1ebac8b06a3e","kind":"oeis_match","node_a_id":"n-708c2ef04340154f","node_b_id":null,"fingerprint":null,"oeis_id":"A127976","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A127976","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A127976","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-708c2ef04340154f","oeis_id":"A127976","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":200,"raw_size":7231}],"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: 1,  4;\n  3: 1,  8;\n  4: 1, 12,  12;\n  5: 1, 16,  36;\n  6: 1, 20,  72,  32;\n  7: 1, 24, 120, 128;\n  8: 1, 28, 180, 320,  80;\n  9: 1, 32, 252, 640, 400;\n","recurrence_sentence":"The row polynomials satisfy (n+2*n^2*x)*P(n,x) = (n+(2*n^2+8*n-8)*x+(8*n^2+8*n-16)*x^2)*P(n-1,x) - (x+(2*n+12)*x^2+(16*n+32)*x^3)*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[((n + (2*n^2 + 8*n - 8)*x + (8*n^2 + 8*n - 16)*x^2)*P[n - 1, x] - (x + (2*n + 12)*x^2 + (16*n + 32)*x^3)*D[P[n - 1, x], x])/(n + 2*n^2*x)]];\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] = ((n + (2*n^2 + 8*n - 8)*x + (8*n^2 + 8*n - 16)*x^2)*v[i - 1] - (x + (2*n + 12)*x^2 + (16*n + 32)*x^3)*deriv(v[i - 1], x))/(n + 2*n^2*x)); 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":["\u03b8+1"],"edges":["e-f7d8bf11b8c8ed69"],"text":"A128099 \u2192 \u03b8+1"},"headline":"A128099 \u2192 \u03b8+1","chain":null}