{"id":"n-e88a150cc5b6bb0f","revision":0,"first_index":0,"fingerprint":"f6-eabb4216ab431665","name":"Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","1"],["1","4"],["1","11","3"],["1","26","25"],["1","57","130","15"],["1","120","546","210"],["1","247","2037","1750","105"],["1","502","7071","11368","2205"],["1","1013","23436","63805","26775","945"],["1","2036","75328","325930","247555","27720"],["1","4083","237127","1561516","1939630","460845","10395"],["1","8178","735813","7150000","13609310","5735730","405405"],["1","16369","2260518","31682651","88346258","59629570","8828820","135135"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","2","5","15","52","203","877","4140","21147","115975","678570","4213597","27644437","190899322"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A124324","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169369,"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-1d160dfdd397bda1"]},{"id":169370,"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-1d160dfdd397bda1"]},{"id":169371,"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-1d160dfdd397bda1"]},{"id":169372,"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-1d160dfdd397bda1"]}],"region_exact":{},"incoming_edges":[{"id":"e-1d160dfdd397bda1","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-e88a150cc5b6bb0f","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction; Theorem 2.3 with the interlacers P'_(n-1) and P_(n-2) (Corollary 2.4 with b_n = V_n)","lean_route":null,"lean_declarations":[],"certificate_hash":"182a8ae55164458217d1586017620d8a3dfe68a146ffd10321cd7b92aa40e42f","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-3f61ea97669fe920","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6e2c2e6550c373d3","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2))."},{"id":"e-67de9e2032b24ea2","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-7368f216018f4712","conclusion_name":"derivative of Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2))."},{"id":"e-7b125f948f86687a","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-7dca04cb8e7e7478","conclusion_name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2))."},{"id":"e-93d4d6b093b51129","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-db9fc0cbc0d855d2","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2))."},{"id":"e-fd68901dcbd8162a","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-fc2cd21d94561523","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2))."}],"used_by_total":5,"links":[{"id":"l-302e72a3c22d75e6","kind":"oeis_match","node_a_id":"n-e88a150cc5b6bb0f","node_b_id":null,"fingerprint":null,"oeis_id":"A203644","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A203644","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-50a6ebe60a98f2e3","kind":"oeis_match","node_a_id":"n-e88a150cc5b6bb0f","node_b_id":null,"fingerprint":null,"oeis_id":"A203645","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A203645","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9892329d6ed99b3c","kind":"oeis_match","node_a_id":"n-e88a150cc5b6bb0f","node_b_id":null,"fingerprint":null,"oeis_id":"A203646","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A203646","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-bbfd8c104d19eb30","kind":"oeis_match","node_a_id":"n-e88a150cc5b6bb0f","node_b_id":null,"fingerprint":null,"oeis_id":"A124324","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":13,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":13,"target":"triangle","terms_compared":51},"in_catalog":true,"oeis_id":"A124324","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-dc47bd676d124340","kind":"oeis_match","node_a_id":"n-e88a150cc5b6bb0f","node_b_id":null,"fingerprint":null,"oeis_id":"A000110","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":"A000110","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A124324","relation":"identification"},{"oeis_id":"A000110","relation":"match_row_sums"},{"oeis_id":"A203644","relation":"match_row_sums"},{"oeis_id":"A203645","relation":"match_row_sums"},{"oeis_id":"A203646","relation":"match_row_sums"},{"oeis_id":"A124324","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e88a150cc5b6bb0f","oeis_id":"A000110","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":27,"oeis_terms_available":27,"term_count":200,"raw_size":25269},{"node_id":"n-e88a150cc5b6bb0f","oeis_id":"A124324","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":51,"oeis_terms_agreeing":51,"oeis_terms_available":51,"term_count":992,"raw_size":34622}],"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;\n  2: 1,   1;\n  3: 1,   4;\n  4: 1,  11,    3;\n  5: 1,  26,   25;\n  6: 1,  57,  130,    15;\n  7: 1, 120,  546,   210;\n  8: 1, 247, 2037,  1750,  105;\n  9: 1, 502, 7071, 11368, 2205;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + x*d/dx P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + x*D[P[n - 1, x], x] + (n - 1)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = v[i - 1] + x*deriv(v[i - 1], x) + (n - 1)*x*v[i - 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":"A124324","target":"triangle","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;\n  2: 1,   1;\n  3: 1,   4;\n  4: 1,  11,    3;\n  5: 1,  26,   25;\n  6: 1,  57,  130,    15;\n  7: 1, 120,  546,   210;\n  8: 1, 247, 2037,  1750,  105;\n  9: 1, 502, 7071, 11368, 2205;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + x*d/dx P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + x*D[P[n - 1, x], x] + (n - 1)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = v[i - 1] + x*deriv(v[i - 1], x) + (n - 1)*x*v[i - 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}}],"derivation":{"root":"n-e88a150cc5b6bb0f","steps":[],"edges":[],"text":"A124324"},"headline":"A124324: Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)).","chain":null}