{"id":"n-bdd072cfaec2cdf3","revision":1,"first_index":0,"fingerprint":"f6-269f20a8987741e2","name":"theta_plus_one of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","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"],["0","2"],["0","2","3"],["0","4","9","4"],["0","12","33","24","5"],["0","48","150","140","50","6"],["0","240","822","900","425","90","7"],["0","1440","5292","6496","3675","1050","147","8"],["0","10080","39204","52528","33845","11760","2254","224","9"],["0","80640","328752","472496","336420","134694","31752","4368","324","10"],["0","725760","3079728","4690800","3618400","1615950","442911","75600","7830","450","11"],["0","7257600","31885920","51014304","42047500","20501580","6314385","1262184","163350","13200","605","12"],["0","79833600","361631520","603671904","526290380","275974380","93376745","21100464","3216807","326700","21175","792","13"],["0","958003200","4459328640","7726238208","7070074440","3943241016","1442491050","359921848","62339706","7494630","613470","32604","1014","14"],["0","12454041600","59408277120","106386868224","101568765480","59746222536","23352831502","6327545224","1215328257","166696530","16219203","1093092","48503","1274","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","5","17","74","394","2484","18108","149904","1389456","14257440","160460640","1965444480","26029779840","370643938560"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-4","4","-1"],["4","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","2"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164485,"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-b250bdc2ec7a3ddf"]},{"id":164486,"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-b250bdc2ec7a3ddf"]},{"id":164487,"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-b250bdc2ec7a3ddf"]}],"region_exact":{},"incoming_edges":[{"id":"e-b250bdc2ec7a3ddf","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-bdd072cfaec2cdf3","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":"963d0bbdb4553d50ea798f16929475834bc57c6e828d512af3ba39a402b7e22d","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-b9fbfb57d9269e2f","role":"sequence","name":"Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 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":[{"id":"l-0f46539c78fd2112","kind":"oeis_match","node_a_id":"n-bdd072cfaec2cdf3","node_b_id":null,"fingerprint":null,"oeis_id":"A000774","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":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A000774","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-7e399f14476b8eb4","kind":"oeis_match","node_a_id":"n-bdd072cfaec2cdf3","node_b_id":null,"fingerprint":null,"oeis_id":"A360174","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":false,"oeis_id":"A360174","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A000774","relation":"match_row_sums"},{"oeis_id":"A360174","relation":"match_triangle"}],"bfiles":[{"node_id":"n-bdd072cfaec2cdf3","oeis_id":"A000774","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":22,"oeis_terms_available":22,"term_count":200,"raw_size":34211},{"node_id":"n-bdd072cfaec2cdf3","oeis_id":"A360174","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":26320}],"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: 0,     2;\n  2: 0,     2,      3;\n  3: 0,     4,      9,      4;\n  4: 0,    12,     33,     24,      5;\n  5: 0,    48,    150,    140,     50,      6;\n  6: 0,   240,    822,    900,    425,     90,     7;\n  7: 0,  1440,   5292,   6496,   3675,   1050,   147,    8;\n  8: 0, 10080,  39204,  52528,  33845,  11760,  2254,  224,   9;\n  9: 0, 80640, 328752, 472496, 336420, 134694, 31752, 4368, 324, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-4*n+4+(2*n-4)*x+x^2)*P(n-2,x) + (2*n-3+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 4*n + 4 + (2*n - 4)*x + x^2)*P[n - 2, x] + (2*n - 3 + 2*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 4*n + 4 + (2*n - 4)*x + x^2)*v[i - 2] + (2*n - 3 + 2*x)*v[i - 1]); 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}},{"oeis_id":"A360174","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 0,     2;\n  2: 0,     2,      3;\n  3: 0,     4,      9,      4;\n  4: 0,    12,     33,     24,      5;\n  5: 0,    48,    150,    140,     50,      6;\n  6: 0,   240,    822,    900,    425,     90,     7;\n  7: 0,  1440,   5292,   6496,   3675,   1050,   147,    8;\n  8: 0, 10080,  39204,  52528,  33845,  11760,  2254,  224,   9;\n  9: 0, 80640, 328752, 472496, 336420, 134694, 31752, 4368, 324, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-4*n+4+(2*n-4)*x+x^2)*P(n-2,x) + (2*n-3+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 4*n + 4 + (2*n - 4)*x + x^2)*P[n - 2, x] + (2*n - 3 + 2*x)*P[n - 1, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 4*n + 4 + (2*n - 4)*x + x^2)*v[i - 2] + (2*n - 3 + 2*x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["\u03b8+1"],"edges":["e-b250bdc2ec7a3ddf"],"text":"A132393 \u2192 \u03b8+1"},"headline":"A132393 \u2192 \u03b8+1","chain":null}