{"id":"n-cc96bf3355920697","revision":1,"first_index":0,"fingerprint":"f6-6ba98ca01708d88c","name":"one_plus_derivative of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["7","14","4"],["13","52","44","8"],["21","140","228","120","16"],["31","310","812","800","304","32"],["43","602","2296","3552","2480","736","64"],["57","1064","5544","12240","13200","7104","1728","128"],["73","1752","11928","35376","53680","44096","19264","3968","256"],["91","2730","23496","89760","180752","206752","136640","50176","8960","512"],["111","4070","43164","205920","528528","794976","725760","400384","126720","19968","1024"],["133","5852","74932","435864","1384240","2632448","3137792","2376192","1123584","312320","44032","2048"],["157","8164","124124","863720","3317600","7750912","11606784","11410944","7368960","3046400","754688","96256","4096"],["183","11102","197652","1619904","7390240","20749248","37953792","46636032","38916864","21880320","8031232","1794048","208896","8192"],["211","14770","304304","2899520","15480608","51328576","112248960","167691264","174155520","126038528","62695424","20684800","4206592","450560","16384"],["241","19280","455056","4985760","30770272","118781312","305325440","543012096","682978560","612964352","391198720","174387200","52236288","9748480","966656","32768"],["273","24752","663408","8279136","58450080","259598976","773587584","1610844928","2403346176","2603673600","2054440960","1171722240","473001984","129712128","22364160","2064384","65536"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["25","117","525","2289","9773","41065","170393","699869","2850625","11529437","46352805","185397705","738216021","2927862481","11571840305"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["7","14","4"]],"recurrence":{"denominator":{"coeffs":[["9","0","-3"],["15","0","-2"],["9","0","0"],["2","0","0"]]},"terms":[{"coeff":{"coeffs":[["21","20","-7","-4"],["29","30","-4","-2"],["13","14","0","0"],["2","2","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","12","-2","-8","-2"],["0","16","8","0","0"],["0","4","2","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165693,"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-3fa839d676fcf5c7"]},{"id":165694,"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-3fa839d676fcf5c7"]},{"id":165695,"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-3fa839d676fcf5c7"]},{"id":165696,"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-3fa839d676fcf5c7"]}],"region_exact":{},"incoming_edges":[{"id":"e-3fa839d676fcf5c7","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-cc96bf3355920697","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":"33c3856091d1b1a7b6cb52710838624c5e64fa75093d602238ac0db5e9a8d62f","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-8eb9bb3a09f0b7fd","role":"sequence","name":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","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:   7,   14,     4;\n  1:  13,   52,    44,      8;\n  2:  21,  140,   228,    120,      16;\n  3:  31,  310,   812,    800,     304,      32;\n  4:  43,  602,  2296,   3552,    2480,     736,      64;\n  5:  57, 1064,  5544,  12240,   13200,    7104,    1728,     128;\n  6:  73, 1752, 11928,  35376,   53680,   44096,   19264,    3968,     256;\n  7:  91, 2730, 23496,  89760,  180752,  206752,  136640,   50176,    8960,    512;\n  8: 111, 4070, 43164, 205920,  528528,  794976,  725760,  400384,  126720,  19968,  1024;\n  9: 133, 5852, 74932, 435864, 1384240, 2632448, 3137792, 2376192, 1123584, 312320, 44032, 2048;\n","recurrence_sentence":"The row polynomials satisfy (2*n^3+9*n^2+15*n+9-(2*n+3)*x^2)*P(n,x) = (2*n^3+13*n^2+29*n+21+(2*n^3+14*n^2+30*n+20)*x-(4*n+7)*x^2-(2*n+4)*x^3)*P(n-1,x) + ((4*n^2+16*n+12)*x+(2*n^2+8*n-2)*x^2-8*x^3-2*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 7 + 14*x + 4*x^2.","mathematica":"P[0, x_] := 7 + 14*x + 4*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n^3 + 13*n^2 + 29*n + 21 + (2*n^3 + 14*n^2 + 30*n + 20)*x - (4*n + 7)*x^2 - (2*n + 4)*x^3)*P[n - 1, x] + ((4*n^2 + 16*n + 12)*x + (2*n^2 + 8*n - 2)*x^2 - 8*x^3 - 2*x^4)*D[P[n - 1, x], x])/(2*n^3 + 9*n^2 + 15*n + 9 - (2*n + 3)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 7 + 14*x + 4*x^2; for(n = 1, N, my(i = n + 1); v[i] = ((2*n^3 + 13*n^2 + 29*n + 21 + (2*n^3 + 14*n^2 + 30*n + 20)*x - (4*n + 7)*x^2 - (2*n + 4)*x^3)*v[i - 1] + ((4*n^2 + 16*n + 12)*x + (2*n^2 + 8*n - 2)*x^2 - 8*x^3 - 2*x^4)*deriv(v[i - 1], x))/(2*n^3 + 9*n^2 + 15*n + 9 - (2*n + 3)*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-8eb9bb3a09f0b7fd","steps":["D+1"],"edges":["e-3fa839d676fcf5c7"],"text":"A123519 \u2192 D+1"},"headline":"A123519 \u2192 D+1","chain":null}