{"id":"n-163abed26b768e53","revision":1,"first_index":0,"fingerprint":"f6-f319c3e41f65e203","name":"one_plus_derivative 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"],["3","2"],["5","4"],["7","14","4"],["9","32","12"],["11","58","48","8"],["13","92","136","32"],["15","134","300","144","16"],["17","184","564","480","80"],["19","242","952","1240","400","32"],["21","308","1488","2688","1520","192"],["23","382","2196","5152","4480","1056","64"],["25","464","3100","9024","10976","4480","448"],["27","554","4224","14760","23520","14784","2688","128"]],"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:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["3","-19","8"],["-5","8","0"],["2","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","0","44","-32"],["1","1","-68","32"],["-3","-20","32","0"],["2","8","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","3","16","-64"],["0","1","0","-64","0"],["0","-2","-16","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161170,"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-0ace6e908f8ea6d4"]},{"id":161171,"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-0ace6e908f8ea6d4"]},{"id":161172,"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-0ace6e908f8ea6d4"]}],"region_exact":{},"incoming_edges":[{"id":"e-0ace6e908f8ea6d4","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-163abed26b768e53","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"5fc9a6cbf1997eab2d7e6f6cf7d15c6ab7db16f5fe1428b6ac9eeb694d20ce33","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-36da170af2a61ba0","kind":"oeis_match","node_a_id":"n-163abed26b768e53","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-163abed26b768e53","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:  3,   2;\n  3:  5,   4;\n  4:  7,  14,   4;\n  5:  9,  32,  12;\n  6: 11,  58,  48,   8;\n  7: 13,  92, 136,  32;\n  8: 15, 134, 300, 144, 16;\n  9: 17, 184, 564, 480, 80;\n","recurrence_sentence":"The row polynomials satisfy (2*n^3-5*n^2+3*n+(8*n^2-19*n)*x+8*n*x^2)*P(n,x) = (2*n^3-3*n^2+n+(8*n^3-20*n^2+n)*x+(32*n^2-68*n+44)*x^2+(32*n-32)*x^3)*P(n-1,x) - ((2*n^2-n)*x+(16*n^2-3)*x^2+(64*n-16)*x^3+64*x^4)*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[((2*n^3 - 3*n^2 + n + (8*n^3 - 20*n^2 + n)*x + (32*n^2 - 68*n + 44)*x^2 + (32*n - 32)*x^3)*P[n - 1, x] - ((2*n^2 - n)*x + (16*n^2 - 3)*x^2 + (64*n - 16)*x^3 + 64*x^4)*D[P[n - 1, x], x])/(2*n^3 - 5*n^2 + 3*n + (8*n^2 - 19*n)*x + 8*n*x^2)]];\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] = ((2*n^3 - 3*n^2 + n + (8*n^3 - 20*n^2 + n)*x + (32*n^2 - 68*n + 44)*x^2 + (32*n - 32)*x^3)*v[i - 1] - ((2*n^2 - n)*x + (16*n^2 - 3)*x^2 + (64*n - 16)*x^3 + 64*x^4)*deriv(v[i - 1], x))/(2*n^3 - 5*n^2 + 3*n + (8*n^2 - 19*n)*x + 8*n*x^2)); 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":["D+1"],"edges":["e-0ace6e908f8ea6d4"],"text":"A128099 \u2192 D+1"},"headline":"A128099 \u2192 D+1","chain":null}