{"id":"n-75ccd0453a9b6cec","revision":3,"first_index":0,"fingerprint":"f6-8de4b75c4559d58b","name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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"],["1"],["1","1"],["1","2"],["1","3","1"],["1","4","3"],["1","5","6","1"],["1","6","10","4"],["1","7","15","10","1"],["1","8","21","20","5"],["1","9","28","35","15","1"],["1","10","36","56","35","6"],["1","11","45","84","70","21","1"],["1","12","55","120","126","56","7"],["1","13","66","165","210","126","28","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","2","3","5","8","13","21","34","55","89","144","233","377","610"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A011973","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"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"}},{"position":1,"source":"derived:basis_map_coefficients_of:oeis_catalog:A128100","source_kind":"derived","equality_edge_id":"e-d3b7ddfd0f1aef36","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158261,"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-0801036cdfff24d2","e-0d3631d0f359c9ce","e-a039cba7823b0b25"]},{"id":158262,"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-0801036cdfff24d2","e-0d3631d0f359c9ce","e-a039cba7823b0b25"]},{"id":158263,"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-0801036cdfff24d2","e-0d3631d0f359c9ce","e-a039cba7823b0b25"]},{"id":158264,"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-0801036cdfff24d2","e-0d3631d0f359c9ce"]},{"id":158265,"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-c6b189213af922ca"]},{"id":158266,"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-c6b189213af922ca"]}],"region_exact":{},"incoming_edges":[{"id":"e-c6b189213af922ca","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-75ccd0453a9b6cec","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":"d8f95b1e8f1a8290fa1d28d62a3230ed66f55c61499bcb9aae6d25728ecbf593","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-d3b7ddfd0f1aef36","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-75ccd0453a9b6cec","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"724f411d2412f21e1f7ef9faef3714d401b088da4d43ee9677389fe0a45c3fc0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-a039cba7823b0b25","operation":{"index_shift":0,"operation":"gamma_polynomial","scale":"1"},"operation_detail":"scale 1, shift 0","conclusion_id":"n-75ccd0453a9b6cec","premise_count":1,"theorem":"gamma criterion (RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff): if P = sum_j gamma_j x^j (1 + x)^(d - 2j) with deg Gamma <= d/2, then P is nonzero and real-rooted with roots in (-inf, 0] if and only if Gamma(z) = sum_j gamma_j z^j is; Gamma(c z) with c != 0 has the roots of Gamma divided by c","lean_route":null,"lean_declarations":[],"certificate_hash":"d44d40049b95fd6a63c9afcfa609e9d7646a85f365045601067e1fdfc17c39a4","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-e00a1cb428776eaa","role":"sequence","name":"delannoy","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]"}]},{"id":"e-0801036cdfff24d2","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-75ccd0453a9b6cec","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"9af6362dca57db0bac2b05eeb707c3159ad751c418442ca87fdfdcc0f9446b79","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-0d3631d0f359c9ce","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-75ccd0453a9b6cec","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"7246e07017856dd0042ba75dd9b9c3f0c39c1a8ece66c8ce940c365457cda5d3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-2a29a8b9938e2bd7","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-7d332fcb7bf9a0f7","conclusion_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2))."},{"id":"e-2bd8266472adce93","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-e1fb974f437104f4","conclusion_name":"basis_map_A013611 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-397aac32dd725997","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-054b8a71941f3c19","conclusion_name":"basis_map_A013610 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-a90a5e9d40e11b93","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-c0b420d860aa68c5","conclusion_name":"basis_map_A008277 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-d0c14addeb793323","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-7d332fcb7bf9a0f7","conclusion_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2))."},{"id":"e-f551c1fe837853a5","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-78b97ad8ac29ceb2","conclusion_name":"basis_map_A013609 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-2126fae20f2e5116","operation":"preserver_image","operation_detail":"hadamard_multiplier, shift 0","conclusion_id":"n-8bfdd58279be42d7","conclusion_name":"Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2)."},{"id":"e-24564bef34b2c2e5","operation":"preserver_image","operation_detail":"reversal, shift -1","conclusion_id":"n-392f49b496f79fbf","conclusion_name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals."},{"id":"e-268a0da4668d8a40","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-14012eded861244a","conclusion_name":"theta_plus_one_squared of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-44df003225948a93","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-cf38558d99f4fe37","conclusion_name":"Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1)."},{"id":"e-46cbbc49f6ae8edc","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-286e213a8791bd45","conclusion_name":"T(n,k) = 2^k*binomial(n,2k+1), where 0 <= k <= floor((n-1)/2), n >= 1."},{"id":"e-61c0454a07890647","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-7d332fcb7bf9a0f7","conclusion_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2))."},{"id":"e-6b3e76cd98792eb8","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-1fe6eede339bc6ea","conclusion_name":"Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences of 01's (0 <= k <= floor(n/2))."},{"id":"e-791d6802d1e7f8a6","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-e3a9cbbad5cb7ab4","conclusion_name":"Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0."},{"id":"e-797e24a252300d6f","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-797e795b2b288bfb","conclusion_name":"one_plus_derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-79fb0bd874276b0d","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-d30abaa0df7d695e","conclusion_name":"derivative of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-7fc1b55fb0aa373a","operation":"preserver_image","operation_detail":"affine, shift 1","conclusion_id":"n-ac04e52510a48bb5","conclusion_name":"Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments."},{"id":"e-9f2b3396d0c866b1","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-fc4868f5abe13716","conclusion_name":"theta_plus_one of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-ddc26a351d976abe","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-7d332fcb7bf9a0f7","conclusion_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2))."},{"id":"e-e05d1c749616842f","operation":"preserver_image","operation_detail":"hadamard_multiplier, shift 0","conclusion_id":"n-169bd483754ab390","conclusion_name":"Triangular array of Motzkin polynomial coefficients."},{"id":"e-e41ac5ad698885bc","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-fd133d9d2402ed18","conclusion_name":"Triangle of odd-numbered terms in rows of Pascal's triangle."},{"id":"e-fb809a8e7c094d2b","operation":"preserver_image","operation_detail":"reversal, shift 1","conclusion_id":"n-21854f4257effb01","conclusion_name":"Triangle read by rows: T(n,k) = binomial(k,n-k)."},{"id":"e-054f5d56a30dc717","operation":"veronese_section","operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-4a078af5d8e10837","conclusion_name":"veronese_section_2_0 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."},{"id":"e-d4f58d8e823ba8d6","operation":"veronese_section","operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-feaf9dc130ceb19e","conclusion_name":"veronese_section_2_1 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials."}],"used_by_total":24,"links":[{"id":"l-1d0a0f7e32bc5a75","kind":"fingerprint_related","node_a_id":"n-75ccd0453a9b6cec","node_b_id":"n-569a801b809b6abd","fingerprint":"f6-8de4b75c4559d58b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8de4b75c4559d58b"},"other_id":"n-569a801b809b6abd","other":{"id":"n-569a801b809b6abd","name":"Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).","first_index":0,"fingerprint":"f6-8de4b75c4559d58b","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","2"]],"card_rows":[["1"],["1","1"],["1","2"],["1","3","1"]],"row_sums_preview":["1","2","3","5","8","13","21","34"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A169803"],"derivation":{"root":"n-569a801b809b6abd","steps":[],"edges":[],"text":"A169803"},"headline":"A169803: Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).","chain":null}},{"id":"l-34d097f85e85c545","kind":"fingerprint_related","node_a_id":"n-75ccd0453a9b6cec","node_b_id":"n-c8b3f39d03de798f","fingerprint":"f6-8de4b75c4559d58b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8de4b75c4559d58b"},"other_id":"n-c8b3f39d03de798f","other":{"id":"n-c8b3f39d03de798f","name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","first_index":1,"fingerprint":"f6-8de4b75c4559d58b","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","1"]],"card_rows":[["1"],["1"],["1","1"],["1","2"]],"row_sums_preview":["1","1","2","3","5","8","13","21"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A052553"],"derivation":{"root":"n-c8b3f39d03de798f","steps":[],"edges":[],"text":"A052553"},"headline":"A052553: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","chain":null}},{"id":"l-3ead1c991cc30511","kind":"fingerprint_related","node_a_id":"n-75ccd0453a9b6cec","node_b_id":"n-392f49b496f79fbf","fingerprint":"f6-8de4b75c4559d58b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8de4b75c4559d58b"},"other_id":"n-392f49b496f79fbf","other":{"id":"n-392f49b496f79fbf","name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","first_index":1,"fingerprint":"f6-8de4b75c4559d58b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","0","2","1"]],"row_sums_preview":["1","1","2","3","5","8","13","21"],"regions":["(-inf, 0]","[-4, 0]","(-4, 0]"],"region_exact":{},"oeis_ids":["A026729"],"derivation":{"root":"n-392f49b496f79fbf","steps":[],"edges":[],"text":"A026729"},"headline":"A026729: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","chain":null}},{"id":"l-7dec323e5b634511","kind":"fingerprint_related","node_a_id":"n-75ccd0453a9b6cec","node_b_id":"n-21854f4257effb01","fingerprint":"f6-8de4b75c4559d58b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8de4b75c4559d58b"},"other_id":"n-21854f4257effb01","other":{"id":"n-21854f4257effb01","name":"Triangle read by rows: T(n,k) = binomial(k,n-k).","first_index":0,"fingerprint":"f6-8de4b75c4559d58b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["0","2","1"]],"card_rows":[["1"],["1","1"],["0","2","1"],["0","1","3","1"]],"row_sums_preview":["1","2","3","5","8","13","21","34"],"regions":["(-inf, 0]","[-4, 0]","(-4, 0]"],"region_exact":{},"oeis_ids":["A030528"],"derivation":{"root":"n-21854f4257effb01","steps":[],"edges":[],"text":"A030528"},"headline":"A030528: Triangle read by rows: T(n,k) = binomial(k,n-k).","chain":null}},{"id":"l-a258cc7f3b992eef","kind":"fingerprint_related","node_a_id":"n-75ccd0453a9b6cec","node_b_id":"n-3f9e71a819c8f308","fingerprint":"f6-8de4b75c4559d58b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-8de4b75c4559d58b"},"other_id":"n-3f9e71a819c8f308","other":{"id":"n-3f9e71a819c8f308","name":"theta_plus_one of Riordan array (1+2x,x(1+x)).","first_index":0,"fingerprint":"f6-8de4b75c4559d58b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["0","6","3"]],"card_rows":[["1"],["2","2"],["0","6","3"],["0","4","12","4"]],"row_sums_preview":["1","4","9","20","40","78","147","272"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c27b11147fce8bfa","steps":["\u03b8+1"],"edges":["e-8fa65daf09475d6c"],"text":"A113214 \u2192 \u03b8+1"},"headline":"A113214 \u2192 \u03b8+1","chain":null}},{"id":"l-07371b484a8d0fb2","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A274163","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-48809a4e02b5c05d","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","node_b_id":null,"fingerprint":null,"oeis_id":"A011973","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":"A011973","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-4bd4666051ad3325","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","node_b_id":null,"fingerprint":null,"oeis_id":"A324969","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":"A324969","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6b30a049682262bb","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A185357","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-7d9744a0191d2d7a","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A248740","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a4b7bfed0dd6592d","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","node_b_id":null,"fingerprint":null,"oeis_id":"A098925","in_catalog":0,"target":"reversed_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":"reversed_triangle","terms_compared":64},"in_catalog":false,"oeis_id":"A098925","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-bb990e59e6b1d213","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":1,"target":"row_sums","terms_compared":11},"in_catalog":false,"oeis_id":"A077373","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-d54278757fc5ca89","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A132636","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e00a2b49630840d7","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A212804","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-fbdee3d8b976fe66","kind":"oeis_match","node_a_id":"n-75ccd0453a9b6cec","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A000045","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A011973","relation":"identification"},{"oeis_id":"A098925","relation":"match_reversed_triangle"},{"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":"A212804","relation":"match_row_sums"},{"oeis_id":"A248740","relation":"match_row_sums"},{"oeis_id":"A274163","relation":"match_row_sums"},{"oeis_id":"A324969","relation":"match_row_sums"},{"oeis_id":"A011973","relation":"match_triangle"}],"bfiles":[{"node_id":"n-75ccd0453a9b6cec","oeis_id":"A011973","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":64,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":992,"raw_size":10577},{"node_id":"n-75ccd0453a9b6cec","oeis_id":"A098925","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":64,"oeis_terms_agreeing":79,"oeis_terms_available":79,"term_count":992,"raw_size":10577}],"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;\n  2: 1, 1;\n  3: 1, 2;\n  4: 1, 3,  1;\n  5: 1, 4,  3;\n  6: 1, 5,  6,  1;\n  7: 1, 6, 10,  4;\n  8: 1, 7, 15, 10, 1;\n  9: 1, 8, 21, 20, 5;\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) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\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] = 1; 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":"A011973","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;\n  2: 1, 1;\n  3: 1, 2;\n  4: 1, 3,  1;\n  5: 1, 4,  3;\n  6: 1, 5,  6,  1;\n  7: 1, 6, 10,  4;\n  8: 1, 7, 15, 10, 1;\n  9: 1, 8, 21, 20, 5;\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) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\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] = 1; 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":"A098925","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1;\n  2: 1,  1;\n  3: 2,  1;\n  4: 1,  3,  1;\n  5: 3,  4,  1;\n  6: 1,  6,  5, 1;\n  7: 4, 10,  6, 1;\n  8: 1, 10, 15, 7, 1;\n  9: 5, 20, 21, 8, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = P(n-1,x) + x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + x*P[n - 2, x]];\nTable[Reverse[CoefficientList[P[n, x], x]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; 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 = Vecrev(c); 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":true,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-75ccd0453a9b6cec","steps":[],"edges":[],"text":"A011973"},"headline":"A011973: Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","chain":null}