{"id":"n-2fddd34ea54e5c04","revision":0,"first_index":0,"fingerprint":"f6-8405a1801e3b0421","name":"basis_map_A008277 of veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["3"],["12"],["39","3"],["120","24"],["363","129","3"],["1092","588","36"],["3279","2457","270","3"],["9840","9744","1632","48"],["29523","37341","8715","462","3"],["88572","139716","42972","3480","60"],["265719","513705","200514","22635","705","3"],["797160","1863960","898800","133512","6360","72"],["2391483","6694149","3908391","734562","48780","999","3"],["7174452","23845836","16598724","3837048","334992","10500","84"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","3","12","42","144","495","1716","6009","21264","76044","274800","1003281","3699864","13778367","51801636"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196417,"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-5f03cf41fef2f692"]},{"id":196418,"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-5f03cf41fef2f692"]},{"id":196419,"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-5f03cf41fef2f692"]}],"region_exact":{},"incoming_edges":[{"id":"e-5f03cf41fef2f692","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-2fddd34ea54e5c04","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"6f50e6e713c170a68830dcaada1561ba4c8e81fd926403e4e3e0ffceab2101a7","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-a1bd1d1e7fcaa1ad","role":"sequence","name":"veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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-f3cd711a88b1023f","kind":"fingerprint_related","node_a_id":"n-c7f86b0d960fa1aa","node_b_id":"n-2fddd34ea54e5c04","fingerprint":"f6-8405a1801e3b0421","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8405a1801e3b0421"},"other_id":"n-c7f86b0d960fa1aa","other":{"id":"n-c7f86b0d960fa1aa","name":"basis_map_A008277 of veronese_section_2_1 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-8405a1801e3b0421","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["4"]],"card_rows":[["1"],["4"],["13","1"],["40","8"]],"row_sums_preview":["0","1","4","14","48","165","572","2003"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["Veronese 2 (j=1)","basis A008277"],"edges":["e-868a2ac5701aa5c6","e-e6bb979cdd71f6c0"],"text":"A038207 \u2192 Veronese 2 (j=1) \u2192 basis A008277"},"headline":"A038207 \u2192 Veronese 2 (j=1) \u2192 basis A008277","chain":null}}],"oeis":[],"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:     0;\n  1:     3;\n  2:    12;\n  3:    39,     3;\n  4:   120,    24;\n  5:   363,   129,    3;\n  6:  1092,   588,   36;\n  7:  3279,  2457,  270,   3;\n  8:  9840,  9744, 1632,  48;\n  9: 29523, 37341, 8715, 462, 3;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3-x)*P(n-2,x) + x*d/dx P(n-2,x) + 4*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 3.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[-(3 - x)*P[n - 2, x] + x*D[P[n - 2, x], x] + 4*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = -(3 - x)*v[i - 2] + x*deriv(v[i - 2], x) + 4*v[i - 1]); 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-51b4f5e7901c2b50","steps":["Veronese 2 (j=1)","basis A008277"],"edges":["e-7d561377a0a291f9","e-5f03cf41fef2f692"],"text":"A120910 \u2192 Veronese 2 (j=1) \u2192 basis A008277"},"headline":"A120910 \u2192 Veronese 2 (j=1) \u2192 basis A008277","chain":null}