{"id":"n-a5d9cd4cf05da467","revision":0,"first_index":0,"fingerprint":"f6-14a6d99741430af3","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.","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"],["2","1"],["2","3"],["2","5","1"],["2","7","4"],["2","9","9","1"],["2","11","16","5"],["2","13","25","14","1"],["2","15","36","30","6"],["2","17","49","55","20","1"],["2","19","64","91","50","7"],["2","21","81","140","105","27","1"],["2","23","100","204","196","77","8"],["2","25","121","285","336","182","35","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,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:A129710","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169393,"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":false,"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-cec80539aa813be1"]},{"id":169394,"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-cec80539aa813be1"]},{"id":169395,"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-cec80539aa813be1"]},{"id":169396,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"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 >= 1","region_exact":null,"edges":["e-cec80539aa813be1"]},{"id":169397,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a real-rooted image with every root <= -c/b = 0"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: every PF input has a real-rooted image with every root <= -c/b = 0","region_exact":null,"edges":["e-bd3929b5a5b502dd"]},{"id":169398,"position":5,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a PF image (zero allowed)"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, 0]: every PF input has a PF image (zero allowed)","region_exact":null,"edges":["e-bd3929b5a5b502dd"]}],"region_exact":{},"incoming_edges":[{"id":"e-bd3929b5a5b502dd","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-a5d9cd4cf05da467","premise_count":0,"theorem":"constant current multiplier: P_0 = 1, P_1 = s, P_(k+2) = a P_(k+1) + (b t + c) P_k with a, s >= 0, b > 0.  P_k(t) = Q_k(b t + c) for the rows Q_k with b = 1, c = 0, whose map sends PF inputs to PF outputs (an interlacing-preserving 2 x 2 matrix, Branden, arXiv:1410.6601, Theorem 8.5), so every PF input has a real-rooted image with roots <= -c/b; PF inputs (also those with roots in any [-R, 0]) have PF images if and only if every P_k(0) >= 0, if and only if a^2 + 4c >= 0 and (2s >= a or c >= s^2 - a s) (RealRooted orderTwoBasis_pf_equivalences, basisTransform_orderTwoBasis_preserves_bounded_pf_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"6e6e2a2eadec4be1c25ab6bbf4917c5f4a5bc895a27175f4bb9abfc4c2a936d7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a real-rooted image with every root <= -c/b = 0"},{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a PF image (zero allowed)"}],"premises":[]},{"id":"e-cec80539aa813be1","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-a5d9cd4cf05da467","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":"37b9e46cdbda9de3b4e68c322fd309e79e8920ab422de755b9b10305e6e8c460","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0209ef584d971e50","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-9590781487512eb2","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 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword."},{"id":"e-29e45d80f39845d3","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-e36311594964b907","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 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword."},{"id":"e-6bff37bed6c42dd9","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-b9e4c12b0bb6a69d","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 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword."},{"id":"e-8937236f6b2a3215","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-72cbbb2f152c8f9c","conclusion_name":"Triangle T(n,k), read by rows, given by (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938."},{"id":"e-bab63d5964f544aa","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-37d6eda65db35526","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 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword."},{"id":"e-1f4d8b5f13666237","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-01db3e9311c87670","conclusion_name":"one_plus_derivative 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."},{"id":"e-933af21fe0b55c22","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-fa81c8524277600a","conclusion_name":"derivative 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."},{"id":"e-98db3ebe0a664f24","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-2b307fcb6ac49d03","conclusion_name":"theta_plus_one_squared 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."},{"id":"e-98dc23cfe2761ff4","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-530cbe1f55af9e87","conclusion_name":"theta_plus_one 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."},{"id":"e-e033cee5579ab2bf","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-72cbbb2f152c8f9c","conclusion_name":"Triangle T(n,k), read by rows, given by (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938."}],"used_by_total":10,"links":[{"id":"l-107d1786f5c7a639","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-1312feb36754f962","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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},{"id":"l-16e279785243b0ad","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-52d9695a23d4b924","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-774fc0082602b24f","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","node_b_id":null,"fingerprint":null,"oeis_id":"A129710","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":64},"in_catalog":true,"oeis_id":"A129710","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a7de8685f064afba","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-c91b702758eb11d1","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-dc68a71de9ad53ee","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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-e6b12ec425de204a","kind":"oeis_match","node_a_id":"n-a5d9cd4cf05da467","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}],"oeis":[{"oeis_id":"A129710","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":"A129710","relation":"match_triangle"}],"bfiles":[{"node_id":"n-a5d9cd4cf05da467","oeis_id":"A129710","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":64,"oeis_terms_agreeing":76,"oeis_terms_available":76,"term_count":992,"raw_size":10747}],"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: 2,  1;\n  3: 2,  3;\n  4: 2,  5,  1;\n  5: 2,  7,  4;\n  6: 2,  9,  9,  1;\n  7: 2, 11, 16,  5;\n  8: 2, 13, 25, 14, 1;\n  9: 2, 15, 36, 30, 6;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + x*P(n-2,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[P[n - 1, x] + x*P[n - 2, 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] = v[i - 1] + x*v[i - 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":"A129710","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: 2;\n  2: 2,  1;\n  3: 2,  3;\n  4: 2,  5,  1;\n  5: 2,  7,  4;\n  6: 2,  9,  9,  1;\n  7: 2, 11, 16,  5;\n  8: 2, 13, 25, 14, 1;\n  9: 2, 15, 36, 30, 6;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + x*P(n-2,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[P[n - 1, x] + x*P[n - 2, 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] = v[i - 1] + x*v[i - 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-a5d9cd4cf05da467","steps":[],"edges":[],"text":"A129710"},"headline":"A129710: 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.","chain":null}