{"id":"n-13e23eca5f474574","revision":0,"first_index":0,"fingerprint":"f6-6fbba7c3cf69e7d1","name":"Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["1","3"],["1","8","7"],["1","17","31","15"],["1","34","96","94","31"],["1","67","258","382","253","63"],["1","132","645","1280","1275","636","127"],["1","261","1545","3845","5115","3831","1531","255"],["1","518","3598","10766","17920","17906","10738","3578","511"],["1","1031","8212","28700","57358","71666","57316","28652","8185","1023"],["1","2056","18459","73776","172074","258048","258006","171984","73701","18424","2047"],["1","4105","40995","184395","491610","860202","1032150","860070","491445","184285","40951","4095"],["1","8202","90156","450670","1351845","2703492","3784704","3784572","2703195","1351570","450516","90102","8191"],["1","16395","196662","1081498","3604755","8110377","12976260","15138684","12975831","8109805","3604326","1081290","196597","16383"],["1","32780","426049","2556112","9372077","23429692","42172845","56229888","56229459","42171844","23428691","9371440","2555839","425972","32767"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","16","64","256","1024","4096","16384","65536","262144","1048576","4194304","16777216","67108864","268435456"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A308737","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","-4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169789,"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":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-1e82d8508291d89b"]},{"id":169790,"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-1e82d8508291d89b"]},{"id":169791,"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-1e82d8508291d89b"]},{"id":169792,"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-1e82d8508291d89b"]}],"region_exact":{},"incoming_edges":[{"id":"e-1e82d8508291d89b","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-13e23eca5f474574","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"0ab92154fa84a62891eacb30fc1426239057103014f29ab1d486f485a16d7df1","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":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0be7da6862d394ec","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-dfff3db745a4b454","conclusion_name":"basis_map_A013611 of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-1ccccd209cda0511","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-6f2154a01224373b","conclusion_name":"basis_map_A013610 of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-2b2554b17e246e10","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-d6a51c5da97a7289","conclusion_name":"basis_map_A013609 of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-7c5991ee94b58083","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-8b21094149bba3a5","conclusion_name":"basis_map_A008277 of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-824c1cf49fd16ab0","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-b262f410552e359a","conclusion_name":"shift_x_plus_one of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-00ce8e5ac4e290ea","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-75137e04e9c9ba8a","conclusion_name":"mobius_x_over_x_plus_one of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-0eced2c694a34c1a","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-7eeb625c0c33664b","conclusion_name":"one_plus_derivative of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-6199a453abfc9f00","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-b262f410552e359a","conclusion_name":"shift_x_plus_one of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-6d18cf1b8971a256","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-a0baa26a40b2e44f","conclusion_name":"reversal of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-8385b7647634af6e","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-bac037884d2391c5","conclusion_name":"theta_plus_one of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."},{"id":"e-88b1f14242293276","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-f9ec10621819e3f8","conclusion_name":"derivative of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient."}],"used_by_total":11,"links":[{"id":"l-8754d353cc7bc56f","kind":"fingerprint_related","node_a_id":"n-13e23eca5f474574","node_b_id":"n-a0baa26a40b2e44f","fingerprint":"f6-6fbba7c3cf69e7d1","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6fbba7c3cf69e7d1"},"other_id":"n-a0baa26a40b2e44f","other":{"id":"n-a0baa26a40b2e44f","name":"reversal of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.","first_index":0,"fingerprint":"f6-6fbba7c3cf69e7d1","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","1"],["7","8","1"]],"card_rows":[["1"],["3","1"],["7","8","1"],["15","31","17","1"]],"row_sums_preview":["1","4","16","64","256","1024","4096","16384"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-13e23eca5f474574","steps":["reverse"],"edges":["e-6d18cf1b8971a256"],"text":"A308737 \u2192 reverse"},"headline":"A308737 \u2192 reverse","chain":null}},{"id":"l-5c6e993e9b732dee","kind":"oeis_match","node_a_id":"n-13e23eca5f474574","node_b_id":null,"fingerprint":null,"oeis_id":"A155543","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":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A155543","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9d3bece823194853","kind":"oeis_match","node_a_id":"n-13e23eca5f474574","node_b_id":null,"fingerprint":null,"oeis_id":"A347478","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":1,"oeis_term_position":1,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A347478","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b002a8b637c0eb2d","kind":"oeis_match","node_a_id":"n-13e23eca5f474574","node_b_id":null,"fingerprint":null,"oeis_id":"A000302","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":"A000302","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-fe119773734b54aa","kind":"oeis_match","node_a_id":"n-13e23eca5f474574","node_b_id":null,"fingerprint":null,"oeis_id":"A308737","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A308737","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A308737","relation":"identification"},{"oeis_id":"A000302","relation":"match_row_sums"},{"oeis_id":"A155543","relation":"match_row_sums"},{"oeis_id":"A347478","relation":"match_row_sums"},{"oeis_id":"A308737","relation":"match_triangle"}],"bfiles":[{"node_id":"n-13e23eca5f474574","oeis_id":"A000302","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":25,"oeis_terms_available":25,"term_count":200,"raw_size":12972},{"node_id":"n-13e23eca5f474574","oeis_id":"A308737","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":18811}],"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,    3;\n  2: 1,    8,    7;\n  3: 1,   17,   31,    15;\n  4: 1,   34,   96,    94,    31;\n  5: 1,   67,  258,   382,   253,    63;\n  6: 1,  132,  645,  1280,  1275,   636,   127;\n  7: 1,  261, 1545,  3845,  5115,  3831,  1531,   255;\n  8: 1,  518, 3598, 10766, 17920, 17906, 10738,  3578,  511;\n  9: 1, 1031, 8212, 28700, 57358, 71666, 57316, 28652, 8185, 1023;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+3*x)*P(n-1,x) - (2+4*x+2*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(3 + 3*x)*P[n - 1, x] - (2 + 4*x + 2*x^2)*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; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 3*x)*v[i - 1] - (2 + 4*x + 2*x^2)*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}},{"oeis_id":"A308737","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1,    3;\n  2: 1,    8,    7;\n  3: 1,   17,   31,    15;\n  4: 1,   34,   96,    94,    31;\n  5: 1,   67,  258,   382,   253,    63;\n  6: 1,  132,  645,  1280,  1275,   636,   127;\n  7: 1,  261, 1545,  3845,  5115,  3831,  1531,   255;\n  8: 1,  518, 3598, 10766, 17920, 17906, 10738,  3578,  511;\n  9: 1, 1031, 8212, 28700, 57358, 71666, 57316, 28652, 8185, 1023;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+3*x)*P(n-1,x) - (2+4*x+2*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(3 + 3*x)*P[n - 1, x] - (2 + 4*x + 2*x^2)*P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 3*x)*v[i - 1] - (2 + 4*x + 2*x^2)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-13e23eca5f474574","steps":[],"edges":[],"text":"A308737"},"headline":"A308737: Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.","chain":null}