{"id":"n-7b9205ef354b4cd5","revision":1,"first_index":0,"fingerprint":"f6-6d973dca5f5aeef0","name":"theta_plus_one of One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","4"],["3","20","9"],["4","56","84","16"],["5","120","378","240","25"],["6","220","1188","1584","550","36"],["7","364","3003","6864","5005","1092","49"],["8","560","6552","22880","28600","13104","1960","64"],["9","816","12852","63648","121550","95472","29988","3264","81"],["10","1140","23256","155040","419900","503880","271320","62016","5130","100"],["11","1540","39501","341088","1243550","2116296","1740970","682176","118503","7700","121"],["12","2024","63756","692208","3268760","7488432","8736504","5230016","1557468","212520","11132","144"],["13","2600","98670","1315600","7811375","23178480","36402100","30904640","14060475","3289000","361790","15600","169"],["14","3276","147420","2368080","17267250","64422540","131047560","149768640","96633810","34534500","6512220","589680","21294","196"],["15","4060","213759","4071600","35767875","163881900","419159475","620470080","538919325","273136500","78689325","12214800","926289","28420","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","32","160","768","3584","16384","73728","327680","1441792","6291456","27262976","117440512","503316480","2147483648"],"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","1"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["-1","-5","-2"],["0","3","9"],["0","2","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","4","-2"],["0","0","8","-8"],["0","0","4","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164875,"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-6b1fb9b9f3839b5c"]},{"id":164876,"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-6b1fb9b9f3839b5c"]},{"id":164877,"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-6b1fb9b9f3839b5c"]},{"id":164878,"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-6b1fb9b9f3839b5c"]}],"region_exact":{},"incoming_edges":[{"id":"e-6b1fb9b9f3839b5c","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-7b9205ef354b4cd5","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":"e77dec027576f492d2feabc519fb29d4642e14ebbf05159b797c47270af051ee","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-2245b35ec7cd4857","role":"sequence","name":"One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.","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-3f18a9a1950ebe64","kind":"oeis_match","node_a_id":"n-7b9205ef354b4cd5","node_b_id":null,"fingerprint":null,"oeis_id":"A292044","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A292044","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A292044","relation":"match_row_sums"}],"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:  2,    4;\n  2:  3,   20,     9;\n  3:  4,   56,    84,     16;\n  4:  5,  120,   378,    240,     25;\n  5:  6,  220,  1188,   1584,    550,     36;\n  6:  7,  364,  3003,   6864,   5005,   1092,     49;\n  7:  8,  560,  6552,  22880,  28600,  13104,   1960,    64;\n  8:  9,  816, 12852,  63648, 121550,  95472,  29988,  3264,   81;\n  9: 10, 1140, 23256, 155040, 419900, 503880, 271320, 62016, 5130, 100;\n","recurrence_sentence":"The row polynomials satisfy -(n-(2*n^3+n^2)*x)*P(n,x) = -(n+1-(2*n^3+3*n^2-5*n+2)*x-(6*n^3+9*n^2-2*n-1)*x^2)*P(n-1,x) - (2*x-(4*n^2+8*n+4)*x^2+(4*n^2+8*n+2)*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 + 1 - (2*n^3 + 3*n^2 - 5*n + 2)*x - (6*n^3 + 9*n^2 - 2*n - 1)*x^2)*P[n - 1, x] - (2*x - (4*n^2 + 8*n + 4)*x^2 + (4*n^2 + 8*n + 2)*x^3)*D[P[n - 1, x], x])/(-n + (2*n^3 + 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 + 1 - (2*n^3 + 3*n^2 - 5*n + 2)*x - (6*n^3 + 9*n^2 - 2*n - 1)*x^2)*v[i - 1] - (2*x - (4*n^2 + 8*n + 4)*x^2 + (4*n^2 + 8*n + 2)*x^3)*deriv(v[i - 1], x))/(-n + (2*n^3 + 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-2245b35ec7cd4857","steps":["\u03b8+1"],"edges":["e-6b1fb9b9f3839b5c"],"text":"A091044 \u2192 \u03b8+1"},"headline":"A091044 \u2192 \u03b8+1","chain":null}