{"id":"n-ef372d4e81b6a9dd","revision":1,"first_index":0,"fingerprint":"f5-9b003b29096317f1","name":"veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","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"],["2"],["5"],["10"],["20","1"],["38","4"],["71","14"],["130","40"],["235","105","1"],["420","256","6"],["744","594","27"],["1308","1324","98"],["2285","2860","315","1"]],"degrees":[-1,-1,0,0,0,0,1,1,1,1,2,2,2,2,3],"row_sums":["0","0","1","2","5","10","21","42","85","170","341","682","1365","2730","5461"],"nonn":true,"definitions":[{"position":0,"source":"derived:veronese_section_2_1","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163055,"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-44260c957624f4a5"]},{"id":163056,"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-44260c957624f4a5"]},{"id":163057,"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-44260c957624f4a5"]}],"region_exact":{},"incoming_edges":[{"id":"e-44260c957624f4a5","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-ef372d4e81b6a9dd","premise_count":1,"theorem":"Veronese sections of Polya frequency sequences (Aissen--Schoenberg--Whitney--Edrei): if P is real-rooted with coefficients of one sign, equivalently nonzero with all roots in (-inf, 0], every section V_(r,j)(P) is zero or real-rooted with roots in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"1c135480a31745e22194f822b1c81f086a171267dc98a03925105e6622a781bd","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-7d332fcb7bf9a0f7","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-a8070053c6e5496b","kind":"oeis_match","node_a_id":"n-ef372d4e81b6a9dd","node_b_id":null,"fingerprint":null,"oeis_id":"A280148","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A280148","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c8a7f64a85e00223","kind":"oeis_match","node_a_id":"n-ef372d4e81b6a9dd","node_b_id":null,"fingerprint":null,"oeis_id":"A000975","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":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A000975","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f6a29118f9708d83","kind":"oeis_match","node_a_id":"n-ef372d4e81b6a9dd","node_b_id":null,"fingerprint":null,"oeis_id":"A279751","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A279751","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A000975","relation":"match_row_sums"},{"oeis_id":"A279751","relation":"match_row_sums"},{"oeis_id":"A280148","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-ef372d4e81b6a9dd","oeis_id":"A000975","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":35,"oeis_terms_available":35,"term_count":200,"raw_size":6946}],"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:   0;\n  1:   0;\n  2:   1;\n  3:   2;\n  4:   5;\n  5:  10;\n  6:  20,  1;\n  7:  38,  4;\n  8:  71, 14;\n  9: 130, 40;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) + P(n-2,x) - 2*P(n-3,x) - (1-x)*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1, P(3,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 1;\nP[3, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] + P[n - 2, x] - 2*P[n - 3, x] - (1 - 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] = 0; v[2] = 0; v[3] = 1; v[4] = 2; for(n = 4, N, my(i = n + 1); v[i] = 2*v[i - 1] + v[i - 2] - 2*v[i - 3] - (1 - 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-75ccd0453a9b6cec","steps":["basis A007318","Veronese 2 (j=1)"],"edges":["e-2a29a8b9938e2bd7","e-44260c957624f4a5"],"text":"A011973 \u2192 basis A007318 \u2192 Veronese 2 (j=1)"},"headline":"A011973 \u2192 basis A007318 \u2192 Veronese 2 (j=1)","chain":null}