{"id":"n-8b66c9f49e6d2f0a","revision":1,"first_index":0,"fingerprint":"f6-9678f4e916f31c27","name":"Interpolating the factorial and the powers of 2. Triangle 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"],["1","2"],["2","8","4"],["6","36","36","8"],["24","192","288","128","16"],["120","1200","2400","1600","400","32"],["720","8640","21600","19200","7200","1152","64"],["5040","70560","211680","235200","117600","28224","3136","128"],["40320","645120","2257920","3010560","1881600","602112","100352","8192","256"],["362880","6531840","26127360","40642560","30481920","12192768","2709504","331776","20736","512"],["3628800","72576000","326592000","580608000","508032000","243855360","67737600","11059200","1036800","51200","1024"],["39916800","878169600","4390848000","8781696000","8781696000","4917749760","1639249920","334540800","41817600","3097600","123904","2048"],["479001600","11496038400","63228211200","140507136000","158070528000","101165137920","39341998080","9634775040","1505433600","148684800","8921088","294912","4096"],["6227020800","161902540800","971415244800","2374570598400","2968213248000","2137113538560","949828239360","271379496960","50883655680","6281932800","502554624","24920064","692224","8192"],["87178291200","2440992153600","15866448998400","42310530662400","58176979660800","46541583728640","23270791864320","7598625914880","1662199418880","246251765760","24625176576","1628110848","67837952","1605632","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","14","86","648","5752","58576","671568","8546432","119401856","1815177984","29808908032","525586164736","9898343691264","198227905206272"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A331333","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"]]},"terms":[{"coeff":{"coeffs":[["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160579,"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-dee2eaa32f0764ef"]},{"id":160580,"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-dee2eaa32f0764ef"]},{"id":160581,"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-dee2eaa32f0764ef"]},{"id":160582,"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-dee2eaa32f0764ef"]}],"region_exact":{},"incoming_edges":[{"id":"e-dee2eaa32f0764ef","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"hadamard_multiplier\",\"factor\":{\"terms\":[{\"kind\":\"inverse_factorial\"}]}}"},"operation_detail":"hadamard_multiplier, shift 0","conclusion_id":"n-8b66c9f49e6d2f0a","premise_count":1,"theorem":"Polya--Schur characterization of multiplier sequences (G. Polya and I. Schur, J. Reine Angew. Math. 144 (1914) 89--113; stated as Theorem 40 of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601): a real sequence (lambda_k) is a multiplier sequence (x^k -> lambda_k x^k maps real-rooted polynomials to real-rooted polynomials or zero) iff sum_k binom(m,k) lambda_k x^k is real-rooted with zeros of one sign for every m, iff sum_k lambda_k x^k / k! (or its reflection) is C x^m e^(a x) prod (1 + alpha_j x) with a, alpha_j >= 0; a product of multiplier sequences is one (composition), and a nonzero factor lambda(n) of the row changes nothing","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_inv_factorial"],"certificate_hash":"975d63d962b2ecfb2f6ecd281bb351919562b81890c7df46f83e525337eb0a6d","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-71965e79e47a4526","role":"sequence","name":"Triangle of coefficients in expansion of (1+2*x)^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-2c36ea4bb7a0c3e3","kind":"oeis_match","node_a_id":"n-8b66c9f49e6d2f0a","node_b_id":null,"fingerprint":null,"oeis_id":"A087912","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":"A087912","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-afb85f3ae4a970bd","kind":"oeis_match","node_a_id":"n-8b66c9f49e6d2f0a","node_b_id":null,"fingerprint":null,"oeis_id":"A331333","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A331333","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A331333","relation":"identification"},{"oeis_id":"A087912","relation":"match_row_sums"},{"oeis_id":"A331333","relation":"match_triangle"}],"bfiles":[{"node_id":"n-8b66c9f49e6d2f0a","oeis_id":"A087912","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":36074},{"node_id":"n-8b66c9f49e6d2f0a","oeis_id":"A331333","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":33092}],"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,       2;\n  2:      2,       8,        4;\n  3:      6,      36,       36,        8;\n  4:     24,     192,      288,      128,       16;\n  5:    120,    1200,     2400,     1600,      400,       32;\n  6:    720,    8640,    21600,    19200,     7200,     1152,      64;\n  7:   5040,   70560,   211680,   235200,   117600,    28224,    3136,    128;\n  8:  40320,  645120,  2257920,  3010560,  1881600,   602112,  100352,   8192,   256;\n  9: 362880, 6531840, 26127360, 40642560, 30481920, 12192768, 2709504, 331776, 20736, 512;\n","recurrence_sentence":"The row polynomials satisfy 2*P(n,x) = (2+4*x)*P(n-1,x) + (1+4*x)*d/dx P(n-1,x) + x*d^2/dx^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[((2 + 4*x)*P[n - 1, x] + (1 + 4*x)*D[P[n - 1, x], x] + x*D[P[n - 1, x], {x, 2}])/(2)]];\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] = ((2 + 4*x)*v[i - 1] + (1 + 4*x)*deriv(v[i - 1], x) + x*deriv(deriv(v[i - 1], x), x))/(2)); 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":"A331333","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:      1,       2;\n  2:      2,       8,        4;\n  3:      6,      36,       36,        8;\n  4:     24,     192,      288,      128,       16;\n  5:    120,    1200,     2400,     1600,      400,       32;\n  6:    720,    8640,    21600,    19200,     7200,     1152,      64;\n  7:   5040,   70560,   211680,   235200,   117600,    28224,    3136,    128;\n  8:  40320,  645120,  2257920,  3010560,  1881600,   602112,  100352,   8192,   256;\n  9: 362880, 6531840, 26127360, 40642560, 30481920, 12192768, 2709504, 331776, 20736, 512;\n","recurrence_sentence":"The row polynomials satisfy 2*P(n,x) = (2+4*x)*P(n-1,x) + (1+4*x)*d/dx P(n-1,x) + x*d^2/dx^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[((2 + 4*x)*P[n - 1, x] + (1 + 4*x)*D[P[n - 1, x], x] + x*D[P[n - 1, x], {x, 2}])/(2)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = ((2 + 4*x)*v[i - 1] + (1 + 4*x)*deriv(v[i - 1], x) + x*deriv(deriv(v[i - 1], x), x))/(2)); 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-71965e79e47a4526","steps":["\u2299 1/k!"],"edges":["e-dee2eaa32f0764ef"],"text":"A013609 \u2192 \u2299 1/k!"},"headline":"A331333: Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","chain":"A013609 \u2192 \u2299 1/k!"}