{"id":"n-8c1a47047f1958de","revision":0,"first_index":0,"fingerprint":"f6-ae9974fb5cf108aa","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.","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"],["1","1"],["0","3"],["0","4","1"],["0","4","4"],["0","4","8","1"],["0","4","12","5"],["0","4","16","13","1"],["0","4","20","25","6"],["0","4","24","41","19","1"],["0","4","28","61","44","7"],["0","4","32","85","85","26","1"],["0","4","36","113","146","70","8"],["0","4","40","145","231","155","34","1"],["0","4","44","181","344","301","104","9"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","2","3","5","8","13","21","34","55","89","144","233","377","610","987"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A129718","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"],["0","3"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2"],["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169399,"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-816c36ad24a03db6"]},{"id":169400,"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-816c36ad24a03db6"]},{"id":169401,"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-816c36ad24a03db6"]},{"id":169402,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-816c36ad24a03db6"]}],"region_exact":{},"incoming_edges":[{"id":"e-816c36ad24a03db6","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-8c1a47047f1958de","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"b7cc81574e46caf3361c39f76634e151d3ce0fcc821ce284bd123079d3500628","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":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-41044ced68e40104","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-b4aa3c7d45504d91","conclusion_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."},{"id":"e-812d7652116e2c87","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-b27d3cb0708b3bee","conclusion_name":"basis_map_A013611 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."},{"id":"e-a5c0a64678a49a0c","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-ef64ba43ed5fa494","conclusion_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."},{"id":"e-b1296eb912be9c77","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-a33c66f6d458cd29","conclusion_name":"basis_map_A013609 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."},{"id":"e-b63a5a9c4b58a982","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-497aea47cac0dd26","conclusion_name":"basis_map_A007318 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."}],"used_by_total":5,"links":[{"id":"l-107f1664be0f0af2","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A202278","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":10},"in_catalog":false,"oeis_id":"A202278","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-113440e1b71132cd","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A248740","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A248740","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-361576c321695715","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A274163","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A274163","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-53b237c6ad891a5a","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A129718","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":15,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":15,"target":"triangle","terms_compared":71},"in_catalog":true,"oeis_id":"A129718","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-54cbe3c9f1a60856","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A185357","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A185357","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-5a742590e08f36df","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A077373","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":2,"target":"row_sums","terms_compared":10},"in_catalog":false,"oeis_id":"A077373","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6938e5b07ad9a379","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A000045","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A000045","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-da21f1ffb9730306","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A212804","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A212804","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-ecedf803e49a4c65","kind":"oeis_match","node_a_id":"n-8c1a47047f1958de","node_b_id":null,"fingerprint":null,"oeis_id":"A132636","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A132636","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A129718","relation":"identification"},{"oeis_id":"A000045","relation":"match_row_sums"},{"oeis_id":"A077373","relation":"match_row_sums"},{"oeis_id":"A132636","relation":"match_row_sums"},{"oeis_id":"A185357","relation":"match_row_sums"},{"oeis_id":"A202278","relation":"match_row_sums"},{"oeis_id":"A212804","relation":"match_row_sums"},{"oeis_id":"A248740","relation":"match_row_sums"},{"oeis_id":"A274163","relation":"match_row_sums"},{"oeis_id":"A129718","relation":"match_triangle"}],"bfiles":[{"node_id":"n-8c1a47047f1958de","oeis_id":"A129718","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":61,"terms_matched":71,"oeis_terms_agreeing":80,"oeis_terms_available":80,"term_count":991,"raw_size":10426}],"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: 1, 1;\n  2: 0, 3;\n  3: 0, 4,  1;\n  4: 0, 4,  4;\n  5: 0, 4,  8,  1;\n  6: 0, 4, 12,  5;\n  7: 0, 4, 16, 13,  1;\n  8: 0, 4, 20, 25,  6;\n  9: 0, 4, 24, 41, 19, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2)*P(n-1,x) + (n-2)*x*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[2, x_] := 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 1, x] + (n - 2)*x*P[n - 2, 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] = 1 + x; v[3] = 3*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2)*v[i - 1] + (n - 2)*x*v[i - 2])/(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}},{"oeis_id":"A129718","target":"triangle","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: 1, 1;\n  2: 0, 3;\n  3: 0, 4,  1;\n  4: 0, 4,  4;\n  5: 0, 4,  8,  1;\n  6: 0, 4, 12,  5;\n  7: 0, 4, 16, 13,  1;\n  8: 0, 4, 20, 25,  6;\n  9: 0, 4, 24, 41, 19, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2)*P(n-1,x) + (n-2)*x*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[2, x_] := 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 1, x] + (n - 2)*x*P[n - 2, 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] = 1 + x; v[3] = 3*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2)*v[i - 1] + (n - 2)*x*v[i - 2])/(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":[],"edges":[],"text":"A129718"},"headline":"A129718: 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.","chain":null}
