{"id":"n-b4aa3c7d45504d91","revision":0,"first_index":0,"fingerprint":"f6-24f7ae38c18430dc","name":"basis_map_A008277 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","1"],["3","3"],["5","7","1"],["8","16","4"],["13","35","14","1"],["21","75","42","5"],["34","158","119","23","1"],["55","329","320","85","6"],["89","679","835","296","34","1"],["144","1392","2124","956","149","7"],["233","2839","5308","2975","615","47","1"],["377","5767","13072","8923","2316","238","8"],["610","11678","31835","26131","8366","1135","62","1"],["987","23589","76818","74895","28869","4879","356","9"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","3","6","13","28","63","143","335","795","1934","4772","12018","30701","79818","210402"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-2"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2"],["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195865,"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-41044ced68e40104"]},{"id":195866,"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-41044ced68e40104"]},{"id":195867,"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-41044ced68e40104"]}],"region_exact":{},"incoming_edges":[{"id":"e-41044ced68e40104","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-b4aa3c7d45504d91","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":"23fca8179e4fa3212264b822f5f3dd43831690dc7573f1a3249b59aa2c99a5b0","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-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,   1;\n  2:  3,   3;\n  3:  5,   7,   1;\n  4:  8,  16,   4;\n  5: 13,  35,  14,   1;\n  6: 21,  75,  42,   5;\n  7: 34, 158, 119,  23,  1;\n  8: 55, 329, 320,  85,  6;\n  9: 89, 679, 835, 296, 34, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-2,x) + (n-2)*x*d/dx P(n-2,x) + (n-2)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 3 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[2, x_] := 3 + 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 2, x] + (n - 2)*x*D[P[n - 2, x], 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 + x; v[3] = 3 + 3*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 2] + (n - 2)*x*deriv(v[i - 2], x) + (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 A008277"],"edges":["e-41044ced68e40104"],"text":"A129718 \u2192 basis A008277"},"headline":"A129718 \u2192 basis A008277","chain":null}
