{"id":"n-20d6880016d8135a","revision":1,"first_index":0,"fingerprint":"f6-5162632e955115eb","name":"basis_map_A008277 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":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["3"],["9","6"],["27","48","12"],["81","294","180","24"],["243","1632","1848","576","48"],["729","8646","16200","8880","1680","96"],["2187","44688","130692","112320","36240","4608","192"],["6561","227814","1004220","1272264","623280","132384","12096","384"],["19683","1152192","7485168","13458816","9400608","2967552","446208","30720","768"],["59049","5800326","54700560","136099680","130324320","57379392","12628224","1414656","76032","1536"],["177147","29119728","394504572","1334298240","1705766880","1006580736","304182144","49305600","4273920","184320","3072"],["531441","145952934","2819771460","12797693304","21432032160","16497083328","6575893632","1446559488","179815680","12418560","439296","6144"],["1594323","730827552","20030306088","120818782656","261347740368","257326147584","131632571136","37743298560","6309616896","620421120","34940928","1032192","12288"],["4782969","3657326406","141673797720","1127429656080","3116462709360","3867935399328","2489140862208","904901217792","195369318144","25648077312","2044483584","95686656","2396160","24576"],["14348907","18296197968","999031236852","10430214500160","36535949115120","56516085609984","45072983731776","20361602426880","5521819480320","929348259840","98319277056","6481133568","256069632","5505024","49152"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","15","87","579","4347","36231","330927","3279003","34961715","398483775","4828396359","61908197427","836597291691","11874365738295","176490406942239"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":162303,"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-1fc5789fa458cf8e"]},{"id":162304,"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-1fc5789fa458cf8e"]},{"id":162305,"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-1fc5789fa458cf8e"]}],"region_exact":{},"incoming_edges":[{"id":"e-1fc5789fa458cf8e","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-20d6880016d8135a","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":"526ab278151515a0fb7e8312f8aa41e20733f3ef99a535b5c25a993a68d8d6e8","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-765f9e2b013b3c68","role":"sequence","name":"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-dba612b04d2fb3e3","kind":"fingerprint_related","node_a_id":"n-a75d298d4f18bd00","node_b_id":"n-20d6880016d8135a","fingerprint":"f6-5162632e955115eb","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5162632e955115eb"},"other_id":"n-a75d298d4f18bd00","other":{"id":"n-a75d298d4f18bd00","name":"basis_map_A008277 of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-5162632e955115eb","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","2"],["9","16","4"]],"card_rows":[["1"],["3","2"],["9","16","4"],["27","98","60","8"]],"row_sums_preview":["1","5","29","193","1449","12077","110309","1093001"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["basis A008277"],"edges":["e-db20805112d196a7"],"text":"A013609 \u2192 basis A008277"},"headline":"A013609 \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:     3;\n  1:     9,       6;\n  2:    27,      48,       12;\n  3:    81,     294,      180,        24;\n  4:   243,    1632,     1848,       576,        48;\n  5:   729,    8646,    16200,      8880,      1680,       96;\n  6:  2187,   44688,   130692,    112320,     36240,     4608,      192;\n  7:  6561,  227814,  1004220,   1272264,    623280,   132384,    12096,     384;\n  8: 19683, 1152192,  7485168,  13458816,   9400608,  2967552,   446208,   30720,   768;\n  9: 59049, 5800326, 54700560, 136099680, 130324320, 57379392, 12628224, 1414656, 76032, 1536;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 3.","mathematica":"P[0, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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":["basis A008277"],"edges":["e-1fc5789fa458cf8e"],"text":"A120909 \u2192 basis A008277"},"headline":"A120909 \u2192 basis A008277","chain":null}