{"id":"n-bd4b98a64f07f1b8","revision":0,"first_index":0,"fingerprint":"f6-8e762d433029ec82","name":"basis_map_A013611 of veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","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":[[],["6"],["12"],["42","96"],["120","384"],["366","1728","1536"],["1092","6528","9216"],["3282","24096","50688","24576"],["9840","85248","233472","196608"],["29526","295296","1004544","1277952","393216"],["88572","1003776","4073472","6881280","3932160"],["265722","3365856","15885312","33669120","29491200","6291456"],["797160","11160192","60051456","153157632","180879360","75497472"],["2391486","36669504","221612544","661487616","988938240","641728512","100663296"],["7174452","119574144","801942528","2743271424","4971036672","4404019200","1409286144"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","6","12","138","504","3630","16836","102642","525168","3000534","15979260","88968666","481543272","2653491198","14456304564"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":204816,"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-a0ee26daf48ac8c0"]},{"id":204817,"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-a0ee26daf48ac8c0"]},{"id":204818,"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-a0ee26daf48ac8c0"]},{"id":204819,"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-a0ee26daf48ac8c0"]}],"region_exact":{},"incoming_edges":[{"id":"e-a0ee26daf48ac8c0","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-bd4b98a64f07f1b8","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":"9603b0c471ff175a488187157834f709fba1bfa1ae4eaabcb4114ebc9e8e13aa","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-82e38e2652e8d358","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 runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","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-695776e3aa5503e3","kind":"fingerprint_related","node_a_id":"n-0dd02675257db16c","node_b_id":"n-bd4b98a64f07f1b8","fingerprint":"f6-8e762d433029ec82","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8e762d433029ec82"},"other_id":"n-0dd02675257db16c","other":{"id":"n-0dd02675257db16c","name":"basis_map_A013611 of veronese_section_2_1 of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-8e762d433029ec82","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["4"]],"card_rows":[["2"],["4"],["14","32"],["40","128"]],"row_sums_preview":["0","2","4","46","168","1210","5612","34214"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["Veronese 2 (j=1)","basis A013611"],"edges":["e-c6792048648d3d6d","e-e0fa20b41bf9253b"],"text":"A013609 \u2192 Veronese 2 (j=1) \u2192 basis A013611"},"headline":"A013609 \u2192 Veronese 2 (j=1) \u2192 basis A013611","chain":null}},{"id":"l-8356f7f1c26cb036","kind":"fingerprint_related","node_a_id":"n-4da956059ccd8a9b","node_b_id":"n-bd4b98a64f07f1b8","fingerprint":"f6-8e762d433029ec82","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8e762d433029ec82"},"other_id":"n-4da956059ccd8a9b","other":{"id":"n-4da956059ccd8a9b","name":"basis_map_A013611 of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).","first_index":0,"fingerprint":"f6-8e762d433029ec82","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["7","16"]],"card_rows":[["1"],["2"],["7","16"],["20","64"]],"row_sums_preview":["1","2","23","84","605","2806","17107","87528"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-cf38558d99f4fe37","steps":["basis A013611"],"edges":["e-949c9a2bfe5c641c"],"text":"A229032 \u2192 basis A013611"},"headline":"A229032 \u2192 basis A013611","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:     6;\n  2:    12;\n  3:    42,     96;\n  4:   120,    384;\n  5:   366,   1728,    1536;\n  6:  1092,   6528,    9216;\n  7:  3282,  24096,   50688,   24576;\n  8:  9840,  85248,  233472,  196608;\n  9: 29526, 295296, 1004544, 1277952, 393216;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+16*x)*P(n-2,x) + 2*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 6.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 6;\nP[n_, x_] := P[n, x] = Expand[(3 + 16*x)*P[n - 2, x] + 2*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] = 6; for(n = 2, N, my(i = n + 1); v[i] = (3 + 16*x)*v[i - 2] + 2*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-765f9e2b013b3c68","steps":["Veronese 2 (j=1)","basis A013611"],"edges":["e-1dcfbe1f89fd593f","e-a0ee26daf48ac8c0"],"text":"A120909 \u2192 Veronese 2 (j=1) \u2192 basis A013611"},"headline":"A120909 \u2192 Veronese 2 (j=1) \u2192 basis A013611","chain":null}
