{"id":"n-d2496557bf6f35d4","revision":0,"first_index":0,"fingerprint":"f6-1697c53452ffcf4a","name":"theta_plus_one of Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).","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":true,"rows":[["1"],["15","2"],["225","60","3"],["3375","1350","135","4"],["50625","27000","4050","240","5"],["759375","506250","101250","9000","375","6"],["11390625","9112500","2278125","270000","16875","540","7"],["170859375","159468750","47840625","7087500","590625","28350","735","8"],["2562890625","2733750000","956812500","170100000","17718750","1134000","44100","960","9"],["38443359375","46132031250","18452812500","3827250000","478406250","38272500","1984500","64800","1215","10"],["576650390625","768867187500","345990234375","82012500000","11960156250","1148175000","74418750","3240000","91125","1500","11"],["8649755859375","12686308593750","6343154296875","1691507812500","281917968750","31574812500","2455818750","133650000","5011875","123750","1815","12"],["129746337890625","207594140625000","114176777343750","33830156250000","6343154296875","811923750000","73674562500","4811400000","225534375","7425000","163350","2160","13"],["1946195068359375","3373404785156250","2024042871093750","659688046875000","137435009765625","19790641406250","2052362812500","156370500000","8795840625","361968750","10617750","210600","2535","14"],["29192926025390625","54493461914062500","35420750244140625","12594044531250000","2886135205078125","461781632812500","53874523828125","4691115000000","307854421875","15202687500","557431875","14742000","266175","2940","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","17","288","4864","81920","1376256","23068672","385875968","6442450944","107374182400","1786706395136","29686813949952","492581209243648","8162774324609024","135107988821114880"],"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":[["15","0"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["225","30","1"],["0","15","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":190116,"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-2f785a440f745a98"]},{"id":190117,"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-2f785a440f745a98"]},{"id":190118,"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-2f785a440f745a98"]},{"id":190119,"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-2f785a440f745a98"]}],"region_exact":{},"incoming_edges":[{"id":"e-2f785a440f745a98","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-d2496557bf6f35d4","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":"21c6ac35c4c40a441b4cec5dce82350ba63cece19b05a82e73d8e70cec027e6b","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-ff0214c333bfdcca","role":"sequence","name":"Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).","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:           1;\n  1:          15,           2;\n  2:         225,          60,           3;\n  3:        3375,        1350,         135,          4;\n  4:       50625,       27000,        4050,        240,         5;\n  5:      759375,      506250,      101250,       9000,       375,        6;\n  6:    11390625,     9112500,     2278125,     270000,     16875,      540,       7;\n  7:   170859375,   159468750,    47840625,    7087500,    590625,    28350,     735,     8;\n  8:  2562890625,  2733750000,   956812500,  170100000,  17718750,  1134000,   44100,   960,    9;\n  9: 38443359375, 46132031250, 18452812500, 3827250000, 478406250, 38272500, 1984500, 64800, 1215, 10;\n","recurrence_sentence":"The row polynomials satisfy (15+n*x)*P(n,x) = (225+(15*n+30)*x+(n+1)*x^2)*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[((225 + (15*n + 30)*x + (n + 1)*x^2)*P[n - 1, x])/(15 + n*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] = ((225 + (15*n + 30)*x + (n + 1)*x^2)*v[i - 1])/(15 + n*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-ff0214c333bfdcca","steps":["\u03b8+1"],"edges":["e-2f785a440f745a98"],"text":"A027467 \u2192 \u03b8+1"},"headline":"A027467 \u2192 \u03b8+1","chain":null}