{"id":"n-6f93222f142b1c00","revision":1,"first_index":0,"fingerprint":"f6-96e89084f9f5d8f5","name":"Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1"],["1","2"],["1","8"],["1","20"],["1","40","40"],["1","70","280"],["1","112","1120"],["1","168","3360","2240"],["1","240","8400","22400"],["1","330","18480","123200"],["1","440","36960","492800","246400"],["1","572","68640","1601600","3203200"],["1","728","120120","4484480","22422400"]],"degrees":[0,0,0,1,1,1,2,2,2,3,3,3,4,4,4],"row_sums":["1","1","1","3","9","21","81","351","1233","5769","31041","142011","776601","4874013","27027729"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A118931","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["0","-3"],["0","1"]]},"deriv_order":0,"offset":3,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159122,"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-340a6e5084723b41"]},{"id":159123,"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-340a6e5084723b41"]},{"id":159124,"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-340a6e5084723b41"]},{"id":159125,"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-340a6e5084723b41"]}],"region_exact":{},"incoming_edges":[{"id":"e-340a6e5084723b41","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-6f93222f142b1c00","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":"32b560717353ed12707ff90afa808cd66d31758e19c1e37efb28306212751b30","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":[]}],"used_by":[{"id":"e-0142626e8a0fd8cd","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-711062fd8ba28820","conclusion_name":"basis_map_A013611 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."},{"id":"e-29d505b34d506bd7","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-b1d15686007b99d5","conclusion_name":"basis_map_A007318 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."},{"id":"e-9ee18672ede43293","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-9d7433d6fcb5d97d","conclusion_name":"basis_map_A013609 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."},{"id":"e-c35f8cdc3744c126","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-7f9160f81d83da94","conclusion_name":"basis_map_A008277 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."},{"id":"e-ed0a9060e2227d5c","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-18dc67fbac8ae269","conclusion_name":"basis_map_A013610 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."},{"id":"e-97aa57c096c47b30","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-b1d15686007b99d5","conclusion_name":"basis_map_A007318 of Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0."}],"used_by_total":6,"links":[{"id":"l-a498347e4a6b9f2e","kind":"oeis_match","node_a_id":"n-6f93222f142b1c00","node_b_id":null,"fingerprint":null,"oeis_id":"A001470","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":"A001470","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b5ce6c229c84a614","kind":"oeis_match","node_a_id":"n-6f93222f142b1c00","node_b_id":null,"fingerprint":null,"oeis_id":"A118931","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":15,"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":15,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A118931","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A118931","relation":"identification"},{"oeis_id":"A001470","relation":"match_row_sums"},{"oeis_id":"A118931","relation":"match_triangle"}],"bfiles":[{"node_id":"n-6f93222f142b1c00","oeis_id":"A001470","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":23190},{"node_id":"n-6f93222f142b1c00","oeis_id":"A118931","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":76,"terms_matched":45,"oeis_terms_agreeing":51,"oeis_terms_available":51,"term_count":1001,"raw_size":32881}],"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;\n  3: 1,   2;\n  4: 1,   8;\n  5: 1,  20;\n  6: 1,  40,   40;\n  7: 1,  70,  280;\n  8: 1, 112, 1120;\n  9: 1, 168, 3360, 2240;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + (n^2-3*n+2)*x*P(n-3,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + (n^2 - 3*n + 2)*x*P[n - 3, 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; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = v[i - 1] + (n^2 - 3*n + 2)*x*v[i - 3]); 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":"A118931","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;\n  3: 1,   2;\n  4: 1,   8;\n  5: 1,  20;\n  6: 1,  40,   40;\n  7: 1,  70,  280;\n  8: 1, 112, 1120;\n  9: 1, 168, 3360, 2240;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + (n^2-3*n+2)*x*P(n-3,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + (n^2 - 3*n + 2)*x*P[n - 3, 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; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = v[i - 1] + (n^2 - 3*n + 2)*x*v[i - 3]); 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-6f93222f142b1c00","steps":[],"edges":[],"text":"A118931"},"headline":"A118931: Triangle, read by rows, where T(n,k) = n!/(k!*(n-3*k)!*3^k) for n>=3*k>=0.","chain":null}