{"id":"n-54284d24a094e2d3","revision":1,"first_index":0,"fingerprint":"f6-d0a612563fb7dda7","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.","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"],["0","1"],["0","1","1"],["0","4","5","1"],["0","36","49","14","1"],["0","576","820","273","30","1"],["0","14400","21076","7645","1023","55","1"],["0","518400","773136","296296","44473","3003","91","1"],["0","25401600","38402064","15291640","2475473","191620","7462","140","1"],["0","1625702400","2483133696","1017067024","173721912","14739153","669188","16422","204","1"],["0","131681894400","202759531776","84865562640","15088541896","1367593305","68943381","1999370","32946","285","1"],["0","13168189440000","20407635072000","8689315795776","1593719752240","151847872396","8261931405","268880381","5293970","61446","385","1"],["0","1593350922240000","2482492033152000","1071814846360896","201529405816816","19967312312156","1151541572401","40796457506","909450751","12728936","108031","506","1"],["0","229442532802560000","359072203696128000","156823829909121024","30092049283982400","3076822378767280","185789298737900","7026231453265","171757365650","2742417535","28285400","180895","650","1"],["0","38775788043632640000","60912644957448192000","26862299458337581056","5242380158902146624","550075031295652720","34475213865472380","1373222414339685","36053226248115","635225929065","7522650135","58856655","290745","819","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","1","2","10","100","1700","44200","1635400","81770000","5315050000","435834100000","44019244100000","5370347780200000","778700428129000000","132379072781930000000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A269944","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"],["-2","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159824,"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-aa0ec4b5da096d18"]},{"id":159825,"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-aa0ec4b5da096d18"]},{"id":159826,"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-aa0ec4b5da096d18"]}],"region_exact":{},"incoming_edges":[{"id":"e-aa0ec4b5da096d18","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-54284d24a094e2d3","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"65dbbe16caac241b370911733891511b686497c25c6f1eaa4d7b49580e205c04","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-0687c4d1ba7aff91","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-abc0ba18569a86e9","conclusion_name":"basis_map_A008277 of 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."},{"id":"e-327e7f94e2e44f03","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-3255c4dcfe77aa0b","conclusion_name":"basis_map_A013609 of 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."},{"id":"e-424ddc300423e142","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-afff5b8d53e95899","conclusion_name":"basis_map_A013611 of 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."},{"id":"e-6064ce9102e0184f","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-26a8a6fa96e268b6","conclusion_name":"basis_map_A013610 of 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."},{"id":"e-fc45cb3590dab8d3","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-c5818ec04781ce60","conclusion_name":"basis_map_A007318 of 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."}],"used_by_total":5,"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-e734a631f8279507","other":{"id":"n-e734a631f8279507","name":"Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","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"],["1","1"],["1","5","4"]],"card_rows":[["1"],["1","1"],["1","5","4"],["1","14","49","36"]],"row_sums_preview":["1","2","10","100","1700","44200","1635400","81770000"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A008955"],"derivation":{"root":"n-e734a631f8279507","steps":[],"edges":[],"text":"A008955"},"headline":"A008955: Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","chain":null}},{"id":"l-4cdd43d521f7fb7c","kind":"oeis_match","node_a_id":"n-54284d24a094e2d3","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":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A101686","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-607b2bdfb15fbfe7","kind":"oeis_match","node_a_id":"n-54284d24a094e2d3","node_b_id":null,"fingerprint":null,"oeis_id":"A269944","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":"A269944","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-dc7446ec8faaa127","kind":"oeis_match","node_a_id":"n-54284d24a094e2d3","node_b_id":null,"fingerprint":null,"oeis_id":"A008955","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":true,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A008955","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A269944","relation":"identification"},{"oeis_id":"A008955","relation":"match_reversed_triangle"},{"oeis_id":"A101686","relation":"match_row_sums"},{"oeis_id":"A269944","relation":"match_triangle"}],"bfiles":[{"node_id":"n-54284d24a094e2d3","oeis_id":"A008955","target":"reversed_triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":44031},{"node_id":"n-54284d24a094e2d3","oeis_id":"A101686","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":17,"oeis_terms_available":17,"term_count":200,"raw_size":67241},{"node_id":"n-54284d24a094e2d3","oeis_id":"A269944","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":41202}],"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: 0,          1;\n  2: 0,          1,          1;\n  3: 0,          4,          5,          1;\n  4: 0,         36,         49,         14,         1;\n  5: 0,        576,        820,        273,        30,        1;\n  6: 0,      14400,      21076,       7645,      1023,       55,      1;\n  7: 0,     518400,     773136,     296296,     44473,     3003,     91,     1;\n  8: 0,   25401600,   38402064,   15291640,   2475473,   191620,   7462,   140,   1;\n  9: 0, 1625702400, 2483133696, 1017067024, 173721912, 14739153, 669188, 16422, 204, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^2-2*n+1+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[(n^2 - 2*n + 1 + 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] = (n^2 - 2*n + 1 + 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":"reversed_triangle","first_row":1,"oeis_offset":0,"reversed":true,"trim_zeros":"low","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":"Row n lists the coefficients of P(n,x) in descending powers of x, down to the lowest nonzero coefficient, where P(n,x) = (n^2+x)*P(n-1,x) for n >= 1, with P(0,x) = x.","mathematica":"P[0, x_] := x;\nP[n_, x_] := P[n, x] = Expand[(n^2 + x)*P[n - 1, x]];\nTable[Reverse[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = x; for(n = 1, N, my(i = n + 1); v[i] = (n^2 + x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":true,"trim_zeros":"low","regular_triangle":true}},{"oeis_id":"A269944","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: 0,          1;\n  2: 0,          1,          1;\n  3: 0,          4,          5,          1;\n  4: 0,         36,         49,         14,         1;\n  5: 0,        576,        820,        273,        30,        1;\n  6: 0,      14400,      21076,       7645,      1023,       55,      1;\n  7: 0,     518400,     773136,     296296,     44473,     3003,     91,     1;\n  8: 0,   25401600,   38402064,   15291640,   2475473,   191620,   7462,   140,   1;\n  9: 0, 1625702400, 2483133696, 1017067024, 173721912, 14739153, 669188, 16422, 204, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^2-2*n+1+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[(n^2 - 2*n + 1 + 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] = (n^2 - 2*n + 1 + 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-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}