{"id":"n-f648c94b3feedf7b","revision":1,"first_index":0,"fingerprint":"f6-12b23884bf72db83","name":"theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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"],["1","4"],["2","12","9"],["6","44","54","16"],["24","200","315","160","25"],["120","1096","2025","1360","375","36"],["720","7056","14616","11760","4375","756","49"],["5040","52272","118188","108304","49000","11592","1372","64"],["40320","438336","1063116","1076544","561225","163296","26754","2304","81"],["362880","4106304","10554300","11578880","6733125","2277828","463050","55680","3645","100"],["3628800","42514560","114782184","134552000","85423250","32473980","7730877","1161600","106920","5500","121"],["39916800","482175360","1358261784","1684129216","1149893250","480223260","129240342","22875072","2646270","192500","7986","144"],["479001600","5945771520","17384035968","22624238208","16430170900","7418525400","2204521319","443304576","60706503","5577000","328757","11232","169"],["6227020800","79211036160","239370453504","325020049536","248942593900","120100276296","38756214497","8642334272","1350241893","147447300","11022011","537264","15379","196"],["87178291200","1133862589440","3529411180416","4975828166400","3993040142000","2039881203360","706056823472","171613041600","29841340815","3731227500","332719387","20638800","845845","20580","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","23","120","724","5012","39332","345832","3371976","36135792","422379792","5349561984","72996193152","1067779243008","16670798231040"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","4","9"],["2","-4","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4","4"],["0","0","4","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","4"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165622,"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-c39b6dfb9ca89700"]},{"id":165623,"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-c39b6dfb9ca89700"]},{"id":165624,"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-c39b6dfb9ca89700"]},{"id":165625,"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-c39b6dfb9ca89700"]}],"region_exact":{},"incoming_edges":[{"id":"e-c39b6dfb9ca89700","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-f648c94b3feedf7b","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":"a28be4827b680e31282655693fb520232d4469ae280cc2fc0e186b1b3ec50cbc","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-efe23a76953cf69d","role":"sequence","name":"Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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-cb5f77322e04df8e","kind":"oeis_match","node_a_id":"n-f648c94b3feedf7b","node_b_id":null,"fingerprint":null,"oeis_id":"A151881","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":"A151881","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A151881","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-f648c94b3feedf7b","oeis_id":"A151881","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":34719}],"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,       4;\n  2:      2,      12,        9;\n  3:      6,      44,       54,       16;\n  4:     24,     200,      315,      160,      25;\n  5:    120,    1096,     2025,     1360,     375,      36;\n  6:    720,    7056,    14616,    11760,    4375,     756,     49;\n  7:   5040,   52272,   118188,   108304,   49000,   11592,   1372,    64;\n  8:  40320,  438336,  1063116,  1076544,  561225,  163296,  26754,  2304,   81;\n  9: 362880, 4106304, 10554300, 11578880, 6733125, 2277828, 463050, 55680, 3645, 100;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(4*n-4)*x-9*x^2)*P(n-2,x) + ((4*n-4)*x^2+4*x^3)*d/dx P(n-2,x) + (2*n-1+4*x)*P(n-1,x) - 4*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n + 1 + (4*n - 4)*x - 9*x^2)*P[n - 2, x] + ((4*n - 4)*x^2 + 4*x^3)*D[P[n - 2, x], x] + (2*n - 1 + 4*x)*P[n - 1, x] - 4*x^2*D[P[n - 1, x], 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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n + 1 + (4*n - 4)*x - 9*x^2)*v[i - 2] + ((4*n - 4)*x^2 + 4*x^3)*deriv(v[i - 2], x) + (2*n - 1 + 4*x)*v[i - 1] - 4*x^2*deriv(v[i - 1], 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-efe23a76953cf69d","steps":["(\u03b8+1)\u00b2"],"edges":["e-c39b6dfb9ca89700"],"text":"A130534 \u2192 (\u03b8+1)\u00b2"},"headline":"A130534 \u2192 (\u03b8+1)\u00b2","chain":null}