{"id":"n-9590781487512eb2","revision":0,"first_index":0,"fingerprint":"f6-1c5c598f4427a8f3","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 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2"],["3","1"],["5","3"],["8","8","1"],["13","19","4"],["21","43","15","1"],["34","94","46","5"],["55","201","134","24","1"],["89","423","366","90","6"],["144","880","969","320","35","1"],["233","1815","2490","1046","155","7"],["377","3719","6277","3295","650","48","1"],["610","7582","15562","9969","2471","245","8"],["987","15397","38112","29426","9016","1183","63","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","4","8","17","36","80","179","415","974","2349","5746","14367","36447","94185"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195868,"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-0209ef584d971e50"]},{"id":195869,"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-0209ef584d971e50"]},{"id":195870,"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-0209ef584d971e50"]}],"region_exact":{},"incoming_edges":[{"id":"e-0209ef584d971e50","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-9590781487512eb2","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":"8d230b70ce2dd4eecc0f0d2e58d4379a47d02f091144244e57209f19876b51e3","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-a5d9cd4cf05da467","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword.","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;\n  2:  3,   1;\n  3:  5,   3;\n  4:  8,   8,   1;\n  5: 13,  19,   4;\n  6: 21,  43,  15,  1;\n  7: 34,  94,  46,  5;\n  8: 55, 201, 134, 24, 1;\n  9: 89, 423, 366, 90, 6;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-2,x) + x*d/dx P(n-2,x) + P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 2, x] + x*D[P[n - 2, x], x] + P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 2] + x*deriv(v[i - 2], x) + 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-a5d9cd4cf05da467","steps":["basis A008277"],"edges":["e-0209ef584d971e50"],"text":"A129710 \u2192 basis A008277"},"headline":"A129710 \u2192 basis A008277","chain":null}