{"id":"n-e734a631f8279507","revision":1,"first_index":0,"fingerprint":"f6-d0a612563fb7dda7","name":"Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","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"],["1","1"],["1","5","4"],["1","14","49","36"],["1","30","273","820","576"],["1","55","1023","7645","21076","14400"],["1","91","3003","44473","296296","773136","518400"],["1","140","7462","191620","2475473","15291640","38402064","25401600"],["1","204","16422","669188","14739153","173721912","1017067024","2483133696","1625702400"],["1","285","32946","1999370","68943381","1367593305","15088541896","84865562640","202759531776","131681894400"],["1","385","61446","5293970","268880381","8261931405","151847872396","1593719752240","8689315795776","20407635072000","13168189440000"],["1","506","108031","12728936","909450751","40796457506","1151541572401","19967312312156","201529405816816","1071814846360896","2482492033152000","1593350922240000"],["1","650","180895","28285400","2742417535","171757365650","7026231453265","185789298737900","3076822378767280","30092049283982400","156823829909121024","359072203696128000","229442532802560000"],["1","819","290745","58856655","7522650135","635225929065","36053226248115","1373222414339685","34475213865472380","550075031295652720","5242380158902146624","26862299458337581056","60912644957448192000","38775788043632640000"],["1","1015","451269","115842675","19058554515","2109665355525","160557508344855","8439654758970225","303626807076050640","7307216948928239200","113057086292850079744","1054368810603158319360","5325923338791614078976","11977654199703478272000","7600054456551997440000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","10","100","1700","44200","1635400","81770000","5315050000","435834100000","44019244100000","5370347780200000","778700428129000000","132379072781930000000","26078677338040210000000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A008955","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","0"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158246,"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":false,"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-c0780e435a2392b0"]},{"id":158247,"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-b6645f2226a58079","e-c0780e435a2392b0"]},{"id":158248,"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-b6645f2226a58079","e-c0780e435a2392b0"]},{"id":158249,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-b6645f2226a58079","e-c0780e435a2392b0"]},{"id":158250,"position":4,"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-b6645f2226a58079"]}],"region_exact":{},"incoming_edges":[{"id":"e-b6645f2226a58079","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-e734a631f8279507","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"13880fbb2bbb46a7635515f999c5ba361e6b15f08551f5fc78711df344219b2d","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":"previous_interlaces_next"}],"premises":[]},{"id":"e-c0780e435a2392b0","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-e734a631f8279507","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"533fc465ae1539094dd33b524bd57be8512ae7c9c37dec951fc3dfe875166b80","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0b3719baa0dde23e","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-6a1d0871f44aed3c","conclusion_name":"basis_map_A007318 of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-8c95d99ebe6d3ebc","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-9116f92e53f934a9","conclusion_name":"basis_map_A013609 of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-a6f64f0979a8db40","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-5ffbcfe26ecef156","conclusion_name":"basis_map_A013610 of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-bf0617bcebb15ed7","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-19baf67faf039883","conclusion_name":"basis_map_A013611 of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-e6241a3fc3f0241e","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-89e3c93a8b6f15a5","conclusion_name":"basis_map_A008277 of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-a0abdef027fe8e86","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-14e741ac555fb2b8","conclusion_name":"obreschkoff_combination of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."},{"id":"e-a0abdef027fe8e86","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-14e741ac555fb2b8","conclusion_name":"obreschkoff_combination of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows."}],"used_by_total":7,"links":[{"id":"l-eb6785bb8bb1b2fa","kind":"fingerprint_related","node_a_id":"n-e734a631f8279507","node_b_id":"n-54284d24a094e2d3","fingerprint":"f6-d0a612563fb7dda7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d0a612563fb7dda7"},"other_id":"n-54284d24a094e2d3","other":{"id":"n-54284d24a094e2d3","name":"Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","first_index":0,"fingerprint":"f6-d0a612563fb7dda7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","4","5","1"]],"row_sums_preview":["1","1","2","10","100","1700","44200","1635400"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A269944"],"derivation":{"root":"n-54284d24a094e2d3","steps":[],"edges":[],"text":"A269944"},"headline":"A269944: Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","chain":null}},{"id":"l-1ec03d1512bd3c2d","kind":"oeis_match","node_a_id":"n-e734a631f8279507","node_b_id":null,"fingerprint":null,"oeis_id":"A008955","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":"A008955","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a89033a7431a6765","kind":"oeis_match","node_a_id":"n-e734a631f8279507","node_b_id":null,"fingerprint":null,"oeis_id":"A101686","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":"A101686","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A008955","relation":"identification"},{"oeis_id":"A101686","relation":"match_row_sums"},{"oeis_id":"A008955","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e734a631f8279507","oeis_id":"A008955","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":44031},{"node_id":"n-e734a631f8279507","oeis_id":"A101686","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":17,"oeis_terms_available":17,"term_count":200,"raw_size":67241}],"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,   1;\n  2: 1,   5,     4;\n  3: 1,  14,    49,      36;\n  4: 1,  30,   273,     820,      576;\n  5: 1,  55,  1023,    7645,    21076,      14400;\n  6: 1,  91,  3003,   44473,   296296,     773136,      518400;\n  7: 1, 140,  7462,  191620,  2475473,   15291640,    38402064,    25401600;\n  8: 1, 204, 16422,  669188, 14739153,  173721912,  1017067024,  2483133696,   1625702400;\n  9: 1, 285, 32946, 1999370, 68943381, 1367593305, 15088541896, 84865562640, 202759531776, 131681894400;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+n^2*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + n^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; for(n = 1, N, my(i = n + 1); v[i] = (1 + n^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":"A008955","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,   1;\n  2: 1,   5,     4;\n  3: 1,  14,    49,      36;\n  4: 1,  30,   273,     820,      576;\n  5: 1,  55,  1023,    7645,    21076,      14400;\n  6: 1,  91,  3003,   44473,   296296,     773136,      518400;\n  7: 1, 140,  7462,  191620,  2475473,   15291640,    38402064,    25401600;\n  8: 1, 204, 16422,  669188, 14739153,  173721912,  1017067024,  2483133696,   1625702400;\n  9: 1, 285, 32946, 1999370, 68943381, 1367593305, 15088541896, 84865562640, 202759531776, 131681894400;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+n^2*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + n^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; for(n = 1, N, my(i = n + 1); v[i] = (1 + n^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-e734a631f8279507","steps":[],"edges":[],"text":"A008955"},"headline":"A008955: Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","chain":null}