{"id":"n-bec6dabccdd13354","revision":1,"first_index":1,"fingerprint":"f6-8431aba371c0cc3d","name":"theta_plus_one of Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) 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":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["0","2"],["0","2","6"],["0","2","18","24"],["0","2","42","144","120"],["0","2","90","600","1200","720"],["0","2","186","2160","7800","10800","5040"],["0","2","378","7224","42000","100800","105840","40320"],["0","2","762","23184","204120","756000","1340640","1128960","362880"],["0","2","1530","72600","932400","5004720","13335840","18627840","13063680","3628800"],["0","2","3066","223920","4092600","30618000","115048080","237081600","272160000","163296000","39916800"],["0","2","6138","684024","17490000","177645600","904614480","2579955840","4311014400","4191264000","2195424000","479001600"],["0","2","12282","2076624","73380120","993168000","6671206080","25296606720","57707717760","80831520000","68058144000","31614105600","6227020800"],["0","2","24570","6279000","303903600","5406120720","46979412480","230445895680","689331202560","1304560857600","1569728160000","1164452889600","485707622400","87178291200"],["0","2","49146","18935280","1247009400","28854025200","319719319920","1988956569600","7588662681600","18634359744000","30047451033600","31645719705600","20966379033600","7933224499200","1307674368000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","8","44","308","2612","25988","296564","3816548","54667412","862440068","14857100084","277474957988","5584100659412","120462266974148"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165741,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-3829ab8c6f8b03f0"]},{"id":165742,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-3829ab8c6f8b03f0"]},{"id":165743,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-3829ab8c6f8b03f0"]}],"region_exact":{},"incoming_edges":[{"id":"e-3829ab8c6f8b03f0","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-bec6dabccdd13354","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":"13503e91df0b44cc69f595bc8d911ca725e44a25c4a33a574a13d093fbb2784d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-2cabfd060b04f15d","role":"sequence","name":"Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-35fac1d1b036464f","kind":"oeis_match","node_a_id":"n-bec6dabccdd13354","node_b_id":null,"fingerprint":null,"oeis_id":"A380977","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":false,"oeis_id":"A380977","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9e2fc6b05cb2924f","kind":"oeis_match","node_a_id":"n-bec6dabccdd13354","node_b_id":null,"fingerprint":null,"oeis_id":"A005649","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A005649","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b797a1a8f4a87499","kind":"oeis_match","node_a_id":"n-bec6dabccdd13354","node_b_id":null,"fingerprint":null,"oeis_id":"A172109","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A172109","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A005649","relation":"match_row_sums"},{"oeis_id":"A172109","relation":"match_row_sums"},{"oeis_id":"A380977","relation":"match_triangle"}],"bfiles":[{"node_id":"n-bec6dabccdd13354","oeis_id":"A005649","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":20,"oeis_terms_available":20,"term_count":200,"raw_size":37545},{"node_id":"n-bec6dabccdd13354","oeis_id":"A380977","target":"triangle","oeis_offset":1,"first_row":1,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":33968}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 0, 2;\n   3: 0, 2,    6;\n   4: 0, 2,   18,    24;\n   5: 0, 2,   42,   144,    120;\n   6: 0, 2,   90,   600,   1200,     720;\n   7: 0, 2,  186,  2160,   7800,   10800,     5040;\n   8: 0, 2,  378,  7224,  42000,  100800,   105840,    40320;\n   9: 0, 2,  762, 23184, 204120,  756000,  1340640,  1128960,   362880;\n  10: 0, 2, 1530, 72600, 932400, 5004720, 13335840, 18627840, 13063680, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*x*P(n-1,x) + (x+x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] + (x + x^2)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = 2*x*v[i - 1] + (x + 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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A380977","target":"triangle","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 0, 2;\n   3: 0, 2,    6;\n   4: 0, 2,   18,    24;\n   5: 0, 2,   42,   144,    120;\n   6: 0, 2,   90,   600,   1200,     720;\n   7: 0, 2,  186,  2160,   7800,   10800,     5040;\n   8: 0, 2,  378,  7224,  42000,  100800,   105840,    40320;\n   9: 0, 2,  762, 23184, 204120,  756000,  1340640,  1128960,   362880;\n  10: 0, 2, 1530, 72600, 932400, 5004720, 13335840, 18627840, 13063680, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*x*P(n-1,x) + (x+x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] + (x + x^2)*D[P[n - 1, x], x]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = 2*x*v[i - 1] + (x + x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-2cabfd060b04f15d","steps":["\u03b8+1"],"edges":["e-3829ab8c6f8b03f0"],"text":"A131689 \u2192 \u03b8+1"},"headline":"A131689 \u2192 \u03b8+1","chain":null}