{"id":"n-ab5ae7f91c188f17","revision":0,"first_index":0,"fingerprint":"f6-772dd6d8aefc1782","name":"Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","1"],["1","3","1"],["0","4","4","1"],["0","4","8","5","1"],["0","4","12","13","6","1"],["0","4","16","25","19","7","1"],["0","4","20","41","44","26","8","1"],["0","4","24","61","85","70","34","9","1"],["0","4","28","85","146","155","104","43","10","1"],["0","4","32","113","231","301","259","147","53","11","1"],["0","4","36","145","344","532","560","406","200","64","12","1"],["0","4","40","181","489","876","1092","966","606","264","76","13","1"],["0","4","44","221","670","1365","1968","2058","1572","870","340","89","14","1"],["0","4","48","265","891","2035","3333","4026","3630","2442","1210","429","103","15","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","5","9","18","36","72","144","288","576","1152","2304","4608","9216","18432"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A202241","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"],["1","3","1"],["0","4","4","1"]],"recurrence":{"denominator":{"coeffs":[["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["-3","-3"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169704,"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-0fe2ae6da5ee43e3"]},{"id":169705,"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-0fe2ae6da5ee43e3"]},{"id":169706,"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-0fe2ae6da5ee43e3"]},{"id":169707,"position":3,"claim":"interlacing","from_index":4,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":4,"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 >= 4","region_exact":null,"edges":["e-0fe2ae6da5ee43e3"]}],"region_exact":{},"incoming_edges":[{"id":"e-0fe2ae6da5ee43e3","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-ab5ae7f91c188f17","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"49131cf78f49b53cbad996669fdabe468e05b97b57e7c35e1ed8392554f4a9e8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":4,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0a41ad7c5299a6cc","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-a22ad4ac78d38d01","conclusion_name":"basis_map_A008277 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m."},{"id":"e-591efb281478fca5","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-6aa546735711342f","conclusion_name":"basis_map_A013609 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m."},{"id":"e-61a471081578e583","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-4368dfcbecf30c52","conclusion_name":"basis_map_A013610 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m."},{"id":"e-8da44b0cbaefa1a6","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-6e51dca61d91ba2f","conclusion_name":"basis_map_A013611 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m."},{"id":"e-fdbdd0b8519ce5a6","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-0a4bd568c4a16034","conclusion_name":"basis_map_A007318 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m."}],"used_by_total":5,"links":[{"id":"l-077cdd5a28c61c48","kind":"oeis_match","node_a_id":"n-ab5ae7f91c188f17","node_b_id":null,"fingerprint":null,"oeis_id":"A005010","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A005010","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-91c0c7a898d511b6","kind":"oeis_match","node_a_id":"n-ab5ae7f91c188f17","node_b_id":null,"fingerprint":null,"oeis_id":"A202241","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"triangle","terms_compared":78},"in_catalog":true,"oeis_id":"A202241","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a4da1380c9a5d071","kind":"oeis_match","node_a_id":"n-ab5ae7f91c188f17","node_b_id":null,"fingerprint":null,"oeis_id":"A116453","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A116453","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b6e641c376b96ade","kind":"oeis_match","node_a_id":"n-ab5ae7f91c188f17","node_b_id":null,"fingerprint":null,"oeis_id":"A391533","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":true,"oeis_offset":2,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":9,"target":"triangle","terms_compared":63},"in_catalog":true,"oeis_id":"A391533","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e41efc4557cc5439","kind":"oeis_match","node_a_id":"n-ab5ae7f91c188f17","node_b_id":null,"fingerprint":null,"oeis_id":"A288135","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":"A288135","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A202241","relation":"identification"},{"oeis_id":"A005010","relation":"match_row_sums"},{"oeis_id":"A116453","relation":"match_row_sums"},{"oeis_id":"A288135","relation":"match_row_sums"},{"oeis_id":"A202241","relation":"match_triangle"},{"oeis_id":"A391533","relation":"match_triangle"}],"bfiles":[{"node_id":"n-ab5ae7f91c188f17","oeis_id":"A005010","target":"row_sums","oeis_offset":0,"first_row":3,"rows_used":200,"terms_matched":12,"oeis_terms_agreeing":32,"oeis_terms_available":32,"term_count":200,"raw_size":7171},{"node_id":"n-ab5ae7f91c188f17","oeis_id":"A116453","target":"row_sums","oeis_offset":1,"first_row":2,"rows_used":200,"terms_matched":13,"oeis_terms_agreeing":34,"oeis_terms_available":34,"term_count":200,"raw_size":7113},{"node_id":"n-ab5ae7f91c188f17","oeis_id":"A202241","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":10612},{"node_id":"n-ab5ae7f91c188f17","oeis_id":"A391533","target":"triangle","oeis_offset":2,"first_row":3,"rows_used":42,"terms_matched":63,"oeis_terms_agreeing":63,"oeis_terms_available":63,"term_count":987,"raw_size":10960}],"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: 1, 3,  1;\n  3: 0, 4,  4,  1;\n  4: 0, 4,  8,  5,   1;\n  5: 0, 4, 12, 13,   6,   1;\n  6: 0, 4, 16, 25,  19,   7,   1;\n  7: 0, 4, 20, 41,  44,  26,   8,  1;\n  8: 0, 4, 24, 61,  85,  70,  34,  9,  1;\n  9: 0, 4, 28, 85, 146, 155, 104, 43, 10, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 1 + 3*x + x^2, P(3,x) = 4*x + 4*x^2 + x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[2, x_] := 1 + 3*x + x^2;\nP[3, x_] := 4*x + 4*x^2 + x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x])/(n - 3)]];\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] = 1 + 3*x + x^2; v[4] = 4*x + 4*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1])/(n - 3)); 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":"A202241","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 2, 1;\n  2: 1, 3,  1;\n  3: 0, 4,  4,  1;\n  4: 0, 4,  8,  5,   1;\n  5: 0, 4, 12, 13,   6,   1;\n  6: 0, 4, 16, 25,  19,   7,   1;\n  7: 0, 4, 20, 41,  44,  26,   8,  1;\n  8: 0, 4, 24, 61,  85,  70,  34,  9,  1;\n  9: 0, 4, 28, 85, 146, 155, 104, 43, 10, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 1 + 3*x + x^2, P(3,x) = 4*x + 4*x^2 + x^3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[2, x_] := 1 + 3*x + x^2;\nP[3, x_] := 4*x + 4*x^2 + x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x])/(n - 3)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; v[3] = 1 + 3*x + x^2; v[4] = 4*x + 4*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1])/(n - 3)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #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":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A391533","target":"triangle","first_row":3,"oeis_offset":2,"reversed":false,"trim_zeros":"low","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   2: 4,  4,   1;\n   3: 4,  8,   5,   1;\n   4: 4, 12,  13,   6,   1;\n   5: 4, 16,  25,  19,   7,    1;\n   6: 4, 20,  41,  44,  26,    8,   1;\n   7: 4, 24,  61,  85,  70,   34,   9,   1;\n   8: 4, 28,  85, 146, 155,  104,  43,  10,   1;\n   9: 4, 32, 113, 231, 301,  259, 147,  53,  11,  1;\n  10: 4, 36, 145, 344, 532,  560, 406, 200,  64, 12,  1;\n  11: 4, 40, 181, 489, 876, 1092, 966, 606, 264, 76, 13, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) for n >= 3, with P(2,x) = 4*x + 4*x^2 + x^3.","mathematica":"P[2, x_] := 4*x + 4*x^2 + x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x])/(n - 2)]];\nTable[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], {n, 2, 11}] // Flatten","pari":"P(N) = {my(v = vector(N - 1)); v[1] = 4*x + 4*x^2 + x^3; for(n = 3, N, my(i = n - 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1])/(n - 2)); v};\nrow(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 1, v[i])))};\nT(11)","reading":{"first_row":3,"offset":2,"reversed":false,"trim_zeros":"low","regular_triangle":false}}],"derivation":{"root":"n-ab5ae7f91c188f17","steps":[],"edges":[],"text":"A202241"},"headline":"A202241: Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","chain":null}
