{"id":"n-07e5356ad37f61ea","revision":2,"first_index":0,"fingerprint":"f6-fae363dac50bb006","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","1"],["1","3","1"],["1","6","6","1"],["1","10","21","10","1"],["1","15","55","55","15","1"],["1","21","120","215","120","21","1"],["1","28","231","665","665","231","28","1"],["1","36","406","1736","2835","1736","406","36","1"],["1","45","666","3990","9891","9891","3990","666","45","1"],["1","55","1035","8310","29505","45297","29505","8310","1035","55","1"],["1","66","1540","16005","77715","173712","173712","77715","16005","1540","66","1"],["1","78","2211","28930","185130","575982","845691","575982","185130","28930","2211","78","1"],["1","91","3081","49621","406120","1693692","3506217","3506217","1693692","406120","49621","3081","91","1"],["1","105","4186","81445","831831","4506502","12687675","18006417","12687675","4506502","831831","81445","4186","105","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","5","14","43","142","499","1850","7193","29186","123109","538078","2430355","11317646","54229907"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A100862","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-efb682efd7da7c4c","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"]]},"terms":[{"coeff":{"coeffs":[["2","0","2"],["0","1","-2"],["0","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","6","2"],["0","0","-4","0"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","4"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158996,"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-e7942008ad3e1420"]},{"id":158997,"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-7078061f6d32a158","e-e7942008ad3e1420"]},{"id":158998,"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-7078061f6d32a158","e-e7942008ad3e1420"]},{"id":158999,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-e7942008ad3e1420"]},{"id":159000,"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-7078061f6d32a158"]}],"region_exact":{},"incoming_edges":[{"id":"e-efb682efd7da7c4c","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-07e5356ad37f61ea","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"c5c88649a23b6255c64854c404bba041a5f1abae1592d8af240a351a78609eef","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-7078061f6d32a158","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-07e5356ad37f61ea","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"b053c8c637fb7b214aaaea8795ee7026bf3ba032a8a76035c9414dc5bce873be","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-07e5356ad37f61ea","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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]"}]},{"id":"e-e7942008ad3e1420","operation":{"operation":"theorem_check","theorem":"liu_wang_derivative_lag"},"operation_detail":"liu_wang_derivative_lag","conclusion_id":"n-07e5356ad37f61ea","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 the interlacers f' and the lag row (strict form, as in the derivative-lag theorems of the RealRooted library, https://github.com/PerAlexandersson/RealRooted), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_nonnegCoeffs","RealRooted.LiuWang.strictInterl_nonpos_lag_sequence"],"certificate_hash":"a1ecadfb8abfb4dc6aec14d8eeddb223dd836fbca8f14a3ec9250d6c7b897774","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":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0f82e3c94102b0bd","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-ea5fd95b906f5bdb","conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-4ab452bc24d56cb0","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-4334eb2bf6ae95c5","conclusion_name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-c30c93b8b626794f","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-fc7946291cba5bcb","conclusion_name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-c6b24692a36542e0","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-6bbd968fe5cbbe11","conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-cc561a8107a8054b","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-bc2a2bcbde5e5784","conclusion_name":"basis_map_A008277 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-037c1a08736a9fd9","operation":"gamma_polynomial","operation_detail":"scale 1, shift 0","conclusion_id":"n-97b51734d39ede6c","conclusion_name":"Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-0dc5896b91f11a29","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-10d12e855fc37e96","conclusion_name":"derivative of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-16a1260593e0941e","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-b37fb34e5b5db4ed","conclusion_name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-2fc15f707287930e","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-6bbd968fe5cbbe11","conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-46744df2075291bc","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-a0ad285c4bcacfa7","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-54bc083045b2db5f","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-67e1193c025dc08d","conclusion_name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-7078061f6d32a158","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-07e5356ad37f61ea","conclusion_name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},{"id":"e-c4e3f52a7fee0dad","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-73a12c842377e405","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."}],"used_by_total":13,"links":[{"id":"l-712d8e4f9ab61788","kind":"oeis_match","node_a_id":"n-07e5356ad37f61ea","node_b_id":null,"fingerprint":null,"oeis_id":"A100862","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"triangle","terms_compared":78},"in_catalog":true,"oeis_id":"A100862","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c44f81307947dfec","kind":"oeis_match","node_a_id":"n-07e5356ad37f61ea","node_b_id":null,"fingerprint":null,"oeis_id":"A005425","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":"A005425","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-d558323904843ed5","kind":"oeis_match","node_a_id":"n-07e5356ad37f61ea","node_b_id":null,"fingerprint":null,"oeis_id":"A100862","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"reversed_triangle","terms_compared":78},"in_catalog":true,"oeis_id":"A100862","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A100862","relation":"identification"},{"oeis_id":"A100862","relation":"match_reversed_triangle"},{"oeis_id":"A005425","relation":"match_row_sums"},{"oeis_id":"A100862","relation":"match_triangle"}],"bfiles":[{"node_id":"n-07e5356ad37f61ea","oeis_id":"A005425","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":18924},{"node_id":"n-07e5356ad37f61ea","oeis_id":"A100862","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":17185},{"node_id":"n-07e5356ad37f61ea","oeis_id":"A100862","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":17185}],"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,  3,   1;\n  3: 1,  6,   6,    1;\n  4: 1, 10,  21,   10,    1;\n  5: 1, 15,  55,   55,   15,    1;\n  6: 1, 21, 120,  215,  120,   21,    1;\n  7: 1, 28, 231,  665,  665,  231,   28,   1;\n  8: 1, 36, 406, 1736, 2835, 1736,  406,  36,  1;\n  9: 1, 45, 666, 3990, 9891, 9891, 3990, 666, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, 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 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + (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":"A100862","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,  3,   1;\n  3: 1,  6,   6,    1;\n  4: 1, 10,  21,   10,    1;\n  5: 1, 15,  55,   55,   15,    1;\n  6: 1, 21, 120,  215,  120,   21,    1;\n  7: 1, 28, 231,  665,  665,  231,   28,   1;\n  8: 1, 36, 406, 1736, 2835, 1736,  406,  36,  1;\n  9: 1, 45, 666, 3990, 9891, 9891, 3990, 666, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + (n - 1)*x*P[n - 2, 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; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + (n - 1)*x*v[i - 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}},{"oeis_id":"A100862","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"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,  3,   1;\n  3: 1,  6,   6,    1;\n  4: 1, 10,  21,   10,    1;\n  5: 1, 15,  55,   55,   15,    1;\n  6: 1, 21, 120,  215,  120,   21,    1;\n  7: 1, 28, 231,  665,  665,  231,   28,   1;\n  8: 1, 36, 406, 1736, 2835, 1736,  406,  36,  1;\n  9: 1, 45, 666, 3990, 9891, 9891, 3990, 666, 45, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+x)*P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + (n - 1)*x*P[n - 2, x]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + (n - 1)*x*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); 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":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-07e5356ad37f61ea","steps":[],"edges":[],"text":"A100862"},"headline":"A100862: Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","chain":null}