{"id":"n-a2db6b6ded7a955c","revision":1,"first_index":0,"fingerprint":"f6-cb89fa103c9b9d7d","name":"Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or 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"],["1","3"],["1","6"],["1","9"],["1","12"],["1","15","9"],["1","18","27"],["1","21","54"],["1","24","90"],["1","27","135","27"],["1","30","189","108"],["1","33","252","270"]],"degrees":[0,0,0,0,1,1,1,1,2,2,2,2,3,3,3],"row_sums":["1","1","1","1","4","7","10","13","25","46","76","115","190","328","556"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A318772","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"],["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","3"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159905,"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-7b49ab4fc0b1a646"]},{"id":159906,"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-7b49ab4fc0b1a646"]},{"id":159907,"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-7b49ab4fc0b1a646"]},{"id":159908,"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-7b49ab4fc0b1a646"]}],"region_exact":{},"incoming_edges":[{"id":"e-7b49ab4fc0b1a646","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-a2db6b6ded7a955c","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":"b56507a83aad54de3e9dd8bd42a97140db73b2e682502b0986b88741a4764488","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-071c62da6fa41f89","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-1afd26bf28e20fd9","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-260a6c47d63b7967","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-0eebbccc63cc701f","conclusion_name":"basis_map_A013610 of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-29514565bff228b1","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-77c62226e58c7329","conclusion_name":"basis_map_A013611 of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-838afcfabc174965","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-1add664145ad0956","conclusion_name":"basis_map_A013609 of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-95ffdd039009de97","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-84ac0e69bd31191f","conclusion_name":"basis_map_A008277 of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-37e8468007561619","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-1afd26bf28e20fd9","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0."},{"id":"e-40a62e5a79cc0439","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-7bfbd1a79b2d2b76","conclusion_name":"Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0)."},{"id":"e-e3a638b293d2df1c","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-11a69976f40ceb7e","conclusion_name":"Triangle T(n,k) = 3*T(n-1,k) + T(n-4,k-1) for k = 0..floor(n/4), with T(0,0) = 1 and T(n,k) = 0 for n or k < 0, read by rows."}],"used_by_total":8,"links":[{"id":"l-4ebd29f7b37325a4","kind":"oeis_match","node_a_id":"n-a2db6b6ded7a955c","node_b_id":null,"fingerprint":null,"oeis_id":"A143454","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A143454","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9801190a8ad491e9","kind":"oeis_match","node_a_id":"n-a2db6b6ded7a955c","node_b_id":null,"fingerprint":null,"oeis_id":"A318774","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":"A318774","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-bad7fbab5763c9d2","kind":"oeis_match","node_a_id":"n-a2db6b6ded7a955c","node_b_id":null,"fingerprint":null,"oeis_id":"A318772","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":36},"in_catalog":true,"oeis_id":"A318772","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A318772","relation":"identification"},{"oeis_id":"A143454","relation":"match_row_sums"},{"oeis_id":"A318774","relation":"match_row_sums"},{"oeis_id":"A318772","relation":"match_triangle"}],"bfiles":[{"node_id":"n-a2db6b6ded7a955c","oeis_id":"A143454","target":"row_sums","oeis_offset":0,"first_row":3,"rows_used":200,"terms_matched":12,"oeis_terms_agreeing":37,"oeis_terms_available":37,"term_count":200,"raw_size":5425},{"node_id":"n-a2db6b6ded7a955c","oeis_id":"A318772","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":87,"terms_matched":36,"oeis_terms_agreeing":72,"oeis_terms_available":72,"term_count":990,"raw_size":13435},{"node_id":"n-a2db6b6ded7a955c","oeis_id":"A318774","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":44,"oeis_terms_available":44,"term_count":200,"raw_size":5295}],"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;\n  4: 1,  3;\n  5: 1,  6;\n  6: 1,  9;\n  7: 1, 12;\n  8: 1, 15,  9;\n  9: 1, 18, 27;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + 3*x*P(n-4,x) for n >= 4, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1, P(3,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 1;\nP[3, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + 3*x*P[n - 4, 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; v[4] = 1; for(n = 4, N, my(i = n + 1); v[i] = v[i - 1] + 3*x*v[i - 4]); 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":"A318772","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;\n  4: 1,  3;\n  5: 1,  6;\n  6: 1,  9;\n  7: 1, 12;\n  8: 1, 15,  9;\n  9: 1, 18, 27;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + 3*x*P(n-4,x) for n >= 4, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1, P(3,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 1;\nP[3, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + 3*x*P[n - 4, 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; v[4] = 1; for(n = 4, N, my(i = n + 1); v[i] = v[i - 1] + 3*x*v[i - 4]); 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-a2db6b6ded7a955c","steps":[],"edges":[],"text":"A318772"},"headline":"A318772: Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0.","chain":null}