{"id":"n-a4ffad71e3e1c62c","revision":1,"first_index":0,"fingerprint":"f6-40b4a235121ab3e8","name":"Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.","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","3"],["1","6"],["1","9"],["1","12","9"],["1","15","27"],["1","18","54"],["1","21","90","27"],["1","24","135","108"],["1","27","189","270"],["1","30","252","540","81"],["1","33","324","945","405"],["1","36","405","1512","1215"]],"degrees":[0,0,0,1,1,1,2,2,2,3,3,3,4,4,4],"row_sums":["1","1","1","4","7","10","22","43","73","139","268","487","904","1708","3169"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A317496","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","3"]]},"deriv_order":0,"offset":3,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159901,"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-196b2df06b390016"]},{"id":159902,"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-196b2df06b390016"]},{"id":159903,"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-196b2df06b390016"]},{"id":159904,"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-196b2df06b390016"]}],"region_exact":{},"incoming_edges":[{"id":"e-196b2df06b390016","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-a4ffad71e3e1c62c","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":"1993c1b537714cd17a68b6b46cc12de0374404ca921288ee874e92ac86660ffe","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-34a8fe142a1eb34c","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-1b544dd56a887d3b","conclusion_name":"basis_map_A013610 of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-3e5def6a97b3833e","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-798a9ec526dde6cd","conclusion_name":"basis_map_A013611 of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-8fe815759743f39f","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-d1eb28f89744a2f0","conclusion_name":"basis_map_A008277 of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-9b585388d6e35163","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-49daf359013a93ca","conclusion_name":"basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-fbd53d49ec356918","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-b3808769b39a4e65","conclusion_name":"shift_x_plus_one of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-118452a35d821699","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-b3808769b39a4e65","conclusion_name":"shift_x_plus_one of Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."}],"used_by_total":6,"links":[{"id":"l-551a6231251b645a","kind":"oeis_match","node_a_id":"n-a4ffad71e3e1c62c","node_b_id":null,"fingerprint":null,"oeis_id":"A084386","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":"A084386","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-65855f1dd73754fc","kind":"oeis_match","node_a_id":"n-a4ffad71e3e1c62c","node_b_id":null,"fingerprint":null,"oeis_id":"A317496","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":"A317496","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A317496","relation":"identification"},{"oeis_id":"A084386","relation":"match_row_sums"},{"oeis_id":"A317496","relation":"match_triangle"}],"bfiles":[{"node_id":"n-a4ffad71e3e1c62c","oeis_id":"A084386","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":35,"oeis_terms_available":35,"term_count":200,"raw_size":6315},{"node_id":"n-a4ffad71e3e1c62c","oeis_id":"A317496","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":76,"terms_matched":45,"oeis_terms_agreeing":70,"oeis_terms_available":70,"term_count":1001,"raw_size":14365}],"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,  3;\n  4: 1,  6;\n  5: 1,  9;\n  6: 1, 12,  9;\n  7: 1, 15, 27;\n  8: 1, 18, 54;\n  9: 1, 21, 90, 27;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + 3*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] + 3*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] + 3*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":"A317496","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,  3;\n  4: 1,  6;\n  5: 1,  9;\n  6: 1, 12,  9;\n  7: 1, 15, 27;\n  8: 1, 18, 54;\n  9: 1, 21, 90, 27;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + 3*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] + 3*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] + 3*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-a4ffad71e3e1c62c","steps":[],"edges":[],"text":"A317496"},"headline":"A317496: Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.","chain":null}