{"id":"n-c1e563106da65798","revision":0,"first_index":0,"fingerprint":"f6-f644afc7d356d9a8","name":"basis_map_A013610 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","9"],["120","72"],["363","378","27"],["1092","1656","324"],["3279","6579","2349","81"],["9840","24624","13392","1296"],["29523","88596","66258","11988","243"],["88572","310032","298728","84240","4860"],["265719","1062909","1261926","499770","54675","729"],["797160","3587256","5081616","2642544","456840","17496"],["2391483","11957454","19729413","12856644","3162645","231822","2187"],["7174452","39459528","74434572","58743792","19207692","2245320","61236"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","3","12","48","192","768","3072","12288","49152","196608","786432","3145728","12582912","50331648","201326592"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":202009,"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-87a724cffc158f6f"]},{"id":202010,"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-87a724cffc158f6f"]},{"id":202011,"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-87a724cffc158f6f"]},{"id":202012,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-87a724cffc158f6f"]}],"region_exact":{},"incoming_edges":[{"id":"e-87a724cffc158f6f","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-c1e563106da65798","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"42ff7548fa1fcd84b24fd51539d7bab9d2dfadb5aa7094c8c1b45f4dfbe74835","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"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-08615e533c12beb1","kind":"fingerprint_related","node_a_id":"n-31712ce39d40c1ae","node_b_id":"n-c1e563106da65798","fingerprint":"f6-f644afc7d356d9a8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f644afc7d356d9a8"},"other_id":"n-31712ce39d40c1ae","other":{"id":"n-31712ce39d40c1ae","name":"basis_map_A013610 of veronese_section_2_1 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-f644afc7d356d9a8","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","3"],["40","24"]],"row_sums_preview":["0","1","4","16","64","256","1024","4096"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["Veronese 2 (j=1)","basis A013610"],"edges":["e-868a2ac5701aa5c6","e-6d001b95ec759b9b"],"text":"A038207 \u2192 Veronese 2 (j=1) \u2192 basis A013610"},"headline":"A038207 \u2192 Veronese 2 (j=1) \u2192 basis A013610","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,     9;\n  4:   120,    72;\n  5:   363,   378,    27;\n  6:  1092,  1656,   324;\n  7:  3279,  6579,  2349,    81;\n  8:  9840, 24624, 13392,  1296;\n  9: 29523, 88596, 66258, 11988, 243;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3-3*x)*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 - 3*x)*P[n - 2, 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 - 3*x)*v[i - 2] + 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 A013610"],"edges":["e-7d561377a0a291f9","e-87a724cffc158f6f"],"text":"A120910 \u2192 Veronese 2 (j=1) \u2192 basis A013610"},"headline":"A120910 \u2192 Veronese 2 (j=1) \u2192 basis A013610","chain":null}