{"id":"n-8eb9bb3a09f0b7fd","revision":1,"first_index":0,"fingerprint":"f6-173f5abf34450e02","name":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1","6","4"],["1","12","20","8"],["1","20","60","56","16"],["1","30","140","224","144","32"],["1","42","280","672","720","352","64"],["1","56","504","1680","2640","2112","832","128"],["1","72","840","3696","7920","9152","5824","1920","256"],["1","90","1320","7392","20592","32032","29120","15360","4352","512"],["1","110","1980","13728","48048","96096","116480","87040","39168","9728","1024"],["1","132","2860","24024","102960","256256","396032","391680","248064","97280","21504","2048"],["1","156","4004","40040","205920","622336","1188096","1488384","1240320","680960","236544","47104","4096"],["1","182","5460","64064","388960","1400256","3224832","4961280","5209344","3745280","1813504","565248","102400","8192"],["1","210","7280","99008","700128","2956096","8062080","14883840","19100928","17228288","10881024","4710400","1331200","221184","16384"],["1","240","9520","148512","1209312","5912192","18811520","40930560","62760192","68913152","54405120","30617600","11980800","3096576","475136","32768"],["1","272","12240","217056","2015520","11286912","41385344","104600320","188280576","246118400","235755520","165335040","83865600","29933568","7127040","1015808","65536"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["11","41","153","571","2131","7953","29681","110771","413403","1542841","5757961","21489003","80198051","299303201","1117014753"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A123519","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1","6","4"],["1","12","20","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159167,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-b5382d7d87df09a0"]},{"id":159168,"position":1,"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-2a4594def0262eef","e-8d057b494ddd47e8","e-b5382d7d87df09a0"]},{"id":159169,"position":2,"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-8d057b494ddd47e8"]},{"id":159170,"position":3,"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-2a4594def0262eef","e-8d057b494ddd47e8"]},{"id":159171,"position":4,"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-2a4594def0262eef","e-8d057b494ddd47e8"]},{"id":159172,"position":5,"claim":"real_rooted","from_index":0,"region_key":"(-2, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0)","region_exact":null,"edges":["e-2a4594def0262eef"]}],"region_exact":{},"incoming_edges":[{"id":"e-2a4594def0262eef","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-8eb9bb3a09f0b7fd","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"7e1e5d7adf1401897d9ce1955b2cbb04f6e112340100c41b1634edcaed6fe0c4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-8d057b494ddd47e8","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-8eb9bb3a09f0b7fd","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"3b19aac92dbca326d0926fa05900490d70e41e9525de5e3a3a03f1cb852f0004","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":[]},{"id":"e-b5382d7d87df09a0","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-8eb9bb3a09f0b7fd","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"4855f37e17c52f9e44d9b2316720ce55c831b7f5f8d1b927885aea7a57d2c4a8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0686670e536a2f53","operation":"basis_map","operation_detail":"A008288","conclusion_id":"n-1c7cd5e31010a2aa","conclusion_name":"basis_map_A008288 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-125a67b606fd2347","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-d5dd236ae5fa65ba","conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-8cd26e1d1ff01e6d","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-f5286435ed391b4f","conclusion_name":"basis_map_A013610 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-ab96494d3bfaa8ca","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-07c6a4edd51718c6","conclusion_name":"basis_map_A013611 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-ad85cdc8ea03f732","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-7d6ae414bdaf021b","conclusion_name":"basis_map_A008277 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-b77c7252fe4ee4d8","operation":"basis_map","operation_detail":"A008288","conclusion_id":"n-1c7cd5e31010a2aa","conclusion_name":"basis_map_A008288 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-fe32eb1bdf118767","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-47b361d1e904fbeb","conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-10dce9fcf56455e3","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-f356d4c20400a3cf","conclusion_name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-2a3f07ca8f61464b","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-782f87aa4c7db77e","conclusion_name":"derivative of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-3fa839d676fcf5c7","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-cc96bf3355920697","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-5215afd4ce728407","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-02a0aaf8c813b743","conclusion_name":"theta_plus_one of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-762ccb2ce32a5929","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-47b361d1e904fbeb","conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-ac14b3745c4c6962","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-35b4d678c1c4e937","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-f3eb2c4fabb73e34","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-ccea8be4a0f670ab","conclusion_name":"reversal of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-012c8084e12ceaa2","operation":"veronese_section","operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-91e348dc87e3e358","conclusion_name":"veronese_section_2_1 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},{"id":"e-01d67bf255e61a74","operation":"veronese_section","operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-77ff1b7e9c0102bd","conclusion_name":"veronese_section_2_0 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."}],"used_by_total":16,"links":[{"id":"l-209047c2650ccdc6","kind":"fingerprint_related","node_a_id":"n-8eb9bb3a09f0b7fd","node_b_id":"n-ccea8be4a0f670ab","fingerprint":"f6-173f5abf34450e02","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-173f5abf34450e02"},"other_id":"n-ccea8be4a0f670ab","other":{"id":"n-ccea8be4a0f670ab","name":"reversal of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","first_index":0,"fingerprint":"f6-173f5abf34450e02","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["4","6","1"],["8","20","12","1"],["16","56","60","20","1"]],"card_rows":[["4","6","1"],["8","20","12","1"],["16","56","60","20","1"],["32","144","224","140","30","1"]],"row_sums_preview":["11","41","153","571","2131","7953","29681","110771"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8eb9bb3a09f0b7fd","steps":["reverse"],"edges":["e-f3eb2c4fabb73e34"],"text":"A123519 \u2192 reverse"},"headline":"A123519 \u2192 reverse","chain":null}},{"id":"l-e96ed98c0eb5dd92","kind":"fingerprint_related","node_a_id":"n-8eb9bb3a09f0b7fd","node_b_id":"n-8cbd6010e0efad10","fingerprint":"f6-173f5abf34450e02","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-173f5abf34450e02"},"other_id":"n-8cbd6010e0efad10","other":{"id":"n-8cbd6010e0efad10","name":"basis_map_A013609 of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).","first_index":0,"fingerprint":"f6-173f5abf34450e02","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","2"],["16","24","4"]],"card_rows":[["1"],["4","2"],["16","24","4"],["64","160","96","8"]],"row_sums_preview":["1","6","44","328","2448","18272","136384","1017984"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c30cb06ad75c5e21","steps":["basis A013609"],"edges":["e-49766d0fffe14f49"],"text":"A103327 \u2192 basis A013609"},"headline":"A103327 \u2192 basis A013609","chain":null}},{"id":"l-b8ea47979451ef7d","kind":"oeis_match","node_a_id":"n-8eb9bb3a09f0b7fd","node_b_id":null,"fingerprint":null,"oeis_id":"A079935","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":1,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A079935","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c9554aad54ba321f","kind":"oeis_match","node_a_id":"n-8eb9bb3a09f0b7fd","node_b_id":null,"fingerprint":null,"oeis_id":"A001835","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":3,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001835","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A001835","relation":"match_row_sums"},{"oeis_id":"A079935","relation":"match_row_sums"},{"oeis_id":"A123519","relation":"tail"}],"bfiles":[],"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,   6,    4;\n  1: 1,  12,   20,     8;\n  2: 1,  20,   60,    56,     16;\n  3: 1,  30,  140,   224,    144,     32;\n  4: 1,  42,  280,   672,    720,    352,     64;\n  5: 1,  56,  504,  1680,   2640,   2112,    832,    128;\n  6: 1,  72,  840,  3696,   7920,   9152,   5824,   1920,    256;\n  7: 1,  90, 1320,  7392,  20592,  32032,  29120,  15360,   4352,   512;\n  8: 1, 110, 1980, 13728,  48048,  96096, 116480,  87040,  39168,  9728,  1024;\n  9: 1, 132, 2860, 24024, 102960, 256256, 396032, 391680, 248064, 97280, 21504, 2048;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1 + 6*x + 4*x^2, P(1,x) = 1 + 12*x + 20*x^2 + 8*x^3.","mathematica":"P[0, x_] := 1 + 6*x + 4*x^2;\nP[1, x_] := 1 + 12*x + 20*x^2 + 8*x^3;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[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 + 6*x + 4*x^2; v[2] = 1 + 12*x + 20*x^2 + 8*x^3; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 1] - 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}}],"derivation":{"root":"n-8eb9bb3a09f0b7fd","steps":[],"edges":[],"text":"A123519"},"headline":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","chain":null}