{"id":"n-ef64ba43ed5fa494","revision":0,"first_index":0,"fingerprint":"f6-81a3eff1e217965b","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.","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":[["1"],["2","3"],["3","9"],["5","18","9"],["8","36","36"],["13","69","99","27"],["21","129","243","135"],["34","237","549","459","81"],["55","429","1179","1323","486"],["89","768","2439","3429","1944","243"],["144","1362","4905","8289","6399","1701"],["233","2397","9648","19035","18630","7776","729"],["377","4191","18639","42039","49896","28674","5832"],["610","7287","35478","90018","125631","92340","29889","2187"],["987","12609","66690","187974","301644","270702","121743","19683"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","5","12","32","80","208","528","1360","3472","8912","22800","58448","149648","383440","982032"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"],["3","9"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-6"],["1","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2"],["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201332,"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-a5c0a64678a49a0c"]},{"id":201333,"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-a5c0a64678a49a0c"]},{"id":201334,"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-a5c0a64678a49a0c"]},{"id":201335,"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-a5c0a64678a49a0c"]}],"region_exact":{},"incoming_edges":[{"id":"e-a5c0a64678a49a0c","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-ef64ba43ed5fa494","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":"84449f489b55b55ffa71a86e4cf9865ceb59035c79be511fc41d29aebeabc00f","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-8c1a47047f1958de","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.","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":[],"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:  1;\n  1:  2,   3;\n  2:  3,   9;\n  3:  5,  18,    9;\n  4:  8,  36,   36;\n  5: 13,  69,   99,   27;\n  6: 21, 129,  243,  135;\n  7: 34, 237,  549,  459,   81;\n  8: 55, 429, 1179, 1323,  486;\n  9: 89, 768, 2439, 3429, 1944, 243;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x)*P(n-2,x) + (n-2)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 3*x, P(2,x) = 3 + 9*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 3*x;\nP[2, x_] := 3 + 9*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x)*P[n - 2, x] + (n - 2)*P[n - 1, x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; v[3] = 3 + 9*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x)*v[i - 2] + (n - 2)*v[i - 1])/(n - 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}}],"derivation":{"root":"n-8c1a47047f1958de","steps":["basis A013610"],"edges":["e-a5c0a64678a49a0c"],"text":"A129718 \u2192 basis A013610"},"headline":"A129718 \u2192 basis A013610","chain":null}
