{"id":"n-b8be27de1bfb545f","revision":0,"first_index":0,"fingerprint":"f6-9678f4e916f31c27","name":"theta_plus_one of Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).","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":[["2"],["4","8"],["12","48","24"],["48","288","288","64"],["240","1920","2880","1280","160"],["1440","14400","28800","19200","4800","384"],["10080","120960","302400","268800","100800","16128","896"],["80640","1128960","3386880","3763200","1881600","451584","50176","2048"],["725760","11612160","40642560","54190080","33868800","10838016","1806336","147456","4608"],["7257600","130636800","522547200","812851200","609638400","243855360","54190080","6635520","414720","10240"],["79833600","1596672000","7185024000","12773376000","11176704000","5364817920","1490227200","243302400","22809600","1126400","22528"],["958003200","21076070400","105380352000","210760704000","210760704000","118025994240","39341998080","8028979200","1003622400","74342400","2973696","49152"],["12454041600","298896998400","1643933491200","3653185536000","4109833728000","2630293585920","1022891950080","250504151040","39141273600","3865804800","231948288","7667712","106496"],["174356582400","4533271142400","27199626854400","66487976755200","83109970944000","59839179079680","26595190702080","7598625914880","1424742359040","175894118400","14071529472","697761792","19382272","229376"],["2615348736000","73229764608000","475993469952000","1269315919872000","1745309389824000","1396247511859200","698123755929600","227958777446400","49865982566400","7387552972800","738755297280","48843325440","2035138560","48168960","491520"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","12","84","688","6480","69024","820064","10745088","153835776","2388037120","39933915648","715413792768","13665240283136","277153623355392","5946837156188160"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","2"],["1","2"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"],["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184464,"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-4280755d03a6cc13"]},{"id":184465,"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-4280755d03a6cc13"]},{"id":184466,"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-4280755d03a6cc13"]}],"region_exact":{},"incoming_edges":[{"id":"e-4280755d03a6cc13","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-b8be27de1bfb545f","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":"7b113c457c6596ee89f780525fe6f41bd255a44d8130dfaad3f2b6539d7a0f85","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-cbd7c2e66114e926","role":"sequence","name":"Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).","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-3338546f6cb1e8fd","kind":"fingerprint_related","node_a_id":"n-aa53854e96f59b0e","node_b_id":"n-b8be27de1bfb545f","fingerprint":"f6-9678f4e916f31c27","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9678f4e916f31c27"},"other_id":"n-aa53854e96f59b0e","other":{"id":"n-aa53854e96f59b0e","name":"reversal of Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-9678f4e916f31c27","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["4","8","2"]],"card_rows":[["1"],["2","1"],["4","8","2"],["8","36","36","6"]],"row_sums_preview":["1","3","14","86","648","5752","58576","671568"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8b66c9f49e6d2f0a","steps":["reverse"],"edges":["e-b4e12c73f4b83d23"],"text":"A331333 \u2192 reverse"},"headline":"A331333 \u2192 reverse","chain":null}},{"id":"l-fc3915e3996fd242","kind":"fingerprint_related","node_a_id":"n-8b66c9f49e6d2f0a","node_b_id":"n-b8be27de1bfb545f","fingerprint":"f6-9678f4e916f31c27","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9678f4e916f31c27"},"other_id":"n-8b66c9f49e6d2f0a","other":{"id":"n-8b66c9f49e6d2f0a","name":"Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-9678f4e916f31c27","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["2","8","4"]],"card_rows":[["1"],["1","2"],["2","8","4"],["6","36","36","8"]],"row_sums_preview":["1","3","14","86","648","5752","58576","671568"],"regions":["(-inf, 0]","(-inf, 0)"],"region_exact":{},"oeis_ids":["A331333"],"derivation":{"root":"n-8b66c9f49e6d2f0a","steps":[],"edges":[],"text":"A331333"},"headline":"A331333: Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","chain":null}}],"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:       2;\n  1:       4,         8;\n  2:      12,        48,        24;\n  3:      48,       288,       288,        64;\n  4:     240,      1920,      2880,      1280,       160;\n  5:    1440,     14400,     28800,     19200,      4800,       384;\n  6:   10080,    120960,    302400,    268800,    100800,     16128,      896;\n  7:   80640,   1128960,   3386880,   3763200,   1881600,    451584,    50176,    2048;\n  8:  725760,  11612160,  40642560,  54190080,  33868800,  10838016,  1806336,  147456,   4608;\n  9: 7257600, 130636800, 522547200, 812851200, 609638400, 243855360, 54190080, 6635520, 414720, 10240;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (n^2+n+(2*n+2)*x)*P(n-1,x) + (n+1)*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 2.","mathematica":"P[0, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((n^2 + n + (2*n + 2)*x)*P[n - 1, x] + (n + 1)*x*D[P[n - 1, x], x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 2; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + n + (2*n + 2)*x)*v[i - 1] + (n + 1)*x*deriv(v[i - 1], x))/(n)); 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-cbd7c2e66114e926","steps":["\u03b8+1"],"edges":["e-4280755d03a6cc13"],"text":"A086915 \u2192 \u03b8+1"},"headline":"A086915 \u2192 \u03b8+1","chain":null}