{"id":"n-a1cb8cca853be542","revision":0,"first_index":0,"fingerprint":"f6-c12a5875baa63cc4","name":"mobius_x_over_x_plus_one of theta_plus_one of Riordan array (1+2x,x(1+x)).","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","4"],["0","6","9"],["0","4","20","20"],["0","0","15","50","40"],["0","0","6","54","120","78"],["0","0","0","28","154","266","147"],["0","0","0","8","112","408","568","272"],["0","0","0","0","45","360","999","1170","495"],["0","0","0","0","10","200","1050","2330","2350","890"],["0","0","0","0","0","66","715","2816","5214","4620","1584"],["0","0","0","0","0","12","324","2280","7128","11304","8928","2796"],["0","0","0","0","0","0","91","1274","6643","17212","23868","17004","4901"],["0","0","0","0","0","0","14","490","4410","18130","40040","49308","31990","8540"],["0","0","0","0","0","0","0","120","2100","13860","46950","90300","99990","59550","14805"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","15","44","105","258","595","1368","3069","6830","15015","32772","70993","152922","327675"],"nonn":true,"definitions":[{"position":0,"source":"derived:mobius_x_over_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["4","18","29","20","5"],["-2","-10","-19","-16","-5"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","17","27","19","5"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172000,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[-1, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0]","region_exact":null,"edges":["e-972fbf1509bd1c6b"]},{"id":172001,"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-972fbf1509bd1c6b"]},{"id":172002,"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-972fbf1509bd1c6b"]}],"region_exact":{},"incoming_edges":[{"id":"e-972fbf1509bd1c6b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-a1cb8cca853be542","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"fTransform","lean_declarations":["RealRooted.splits_fPolynomial"],"certificate_hash":"051312ec5bed8349007fe2a2015faf1c3c651ec4ef51bc7cbe66a50fb6cfcfde","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-3f9e71a819c8f308","role":"sequence","name":"theta_plus_one of Riordan array (1+2x,x(1+x)).","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":[{"id":"l-1813b8ac0d807426","kind":"fingerprint_related","node_a_id":"n-622af52a4165c278","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-622af52a4165c278","other":{"id":"n-622af52a4165c278","name":"shift_x_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","first_index":1,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","1"]],"card_rows":[["1"],["1"],["2","1"],["3","2"]],"row_sums_preview":["1","1","3","5","11","21","43","85"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8b3f39d03de798f","steps":["x \u21a6 x+1"],"edges":["e-13fa50edf65b735e"],"text":"A052553 \u2192 x \u21a6 x+1"},"headline":"A052553 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-5a2e83b9d1518c96","kind":"fingerprint_related","node_a_id":"n-dbc168630d629d01","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-dbc168630d629d01","other":{"id":"n-dbc168630d629d01","name":"mobius_x_over_x_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","first_index":1,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","2"]],"card_rows":[["1"],["0","1"],["0","1","2"],["0","0","2","3"]],"row_sums_preview":["1","1","3","5","11","21","43","85"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-392f49b496f79fbf","steps":["x \u21a6 x/(x+1)"],"edges":["e-3f0133638547078b"],"text":"A026729 \u2192 x \u21a6 x/(x+1)"},"headline":"A026729 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-64f92c303d23b4cc","kind":"fingerprint_related","node_a_id":"n-aeb67fdaad2bc42e","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-aeb67fdaad2bc42e","other":{"id":"n-aeb67fdaad2bc42e","name":"shift_x_plus_one of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).","first_index":0,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["3","2"]],"card_rows":[["1"],["2","1"],["3","2"],["5","5","1"]],"row_sums_preview":["1","3","5","11","21","43","85","171"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-569a801b809b6abd","steps":["x \u21a6 x+1"],"edges":["e-124c90dc6fe1d800"],"text":"A169803 \u2192 x \u21a6 x+1"},"headline":"A169803 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-65a9ba2884bea0f9","kind":"fingerprint_related","node_a_id":"n-7d332fcb7bf9a0f7","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-7d332fcb7bf9a0f7","other":{"id":"n-7d332fcb7bf9a0f7","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)).","first_index":0,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","1"]],"card_rows":[["1"],["1"],["2","1"],["3","2"]],"row_sums_preview":["1","1","3","5","11","21","43","85"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":["A128100"],"derivation":{"root":"n-7d332fcb7bf9a0f7","steps":[],"edges":[],"text":"A128100"},"headline":"A128100: 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)).","chain":null}},{"id":"l-6b12ad61f38f3069","kind":"fingerprint_related","node_a_id":"n-e7c079f81f452bf3","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-e7c079f81f452bf3","other":{"id":"n-e7c079f81f452bf3","name":"Another version of Fibonacci-Pascal triangle A037027.","first_index":0,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","2"]],"card_rows":[["1"],["0","1"],["0","1","2"],["0","0","2","3"]],"row_sums_preview":["1","1","3","5","11","21","43","85"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":["A111006"],"derivation":{"root":"n-e7c079f81f452bf3","steps":[],"edges":[],"text":"A111006"},"headline":"A111006: Another version of Fibonacci-Pascal triangle A037027.","chain":null}},{"id":"l-880601766af8e1b4","kind":"fingerprint_related","node_a_id":"n-359dae48f9937424","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-359dae48f9937424","other":{"id":"n-359dae48f9937424","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) = binomial(k,n-k).","first_index":0,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["0","2","3"]],"card_rows":[["1"],["1","2"],["0","2","3"],["0","1","5","5"]],"row_sums_preview":["1","3","5","11","21","43","85","171"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-21854f4257effb01","steps":["x \u21a6 x/(x+1)"],"edges":["e-5f893429686fee24"],"text":"A030528 \u2192 x \u21a6 x/(x+1)"},"headline":"A030528 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-9a6c8efa6ba5837a","kind":"fingerprint_related","node_a_id":"n-ef1acb736e5c4a3b","node_b_id":"n-a1cb8cca853be542","fingerprint":"f6-c12a5875baa63cc4","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c12a5875baa63cc4"},"other_id":"n-ef1acb736e5c4a3b","other":{"id":"n-ef1acb736e5c4a3b","name":"derivative of Triangle read by rows: T(n,k) is the number of induced subgraphs of the Lucas cube Lambda(n) that are isomorphic to the hypercube Q(k).","first_index":0,"fingerprint":"f6-c12a5875baa63cc4","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],[],["2"]],"card_rows":[["2"],["3"],["8","4"],["15","10"]],"row_sums_preview":["0","0","2","3","12","25","66","147"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-299efe8218728fe3","steps":["D"],"edges":["e-a4db8fbaa61eae59"],"text":"A245962 \u2192 D"},"headline":"A245962 \u2192 D","chain":null}}],"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, 4;\n  2: 0, 6,  9;\n  3: 0, 4, 20, 20;\n  4: 0, 0, 15, 50,  40;\n  5: 0, 0,  6, 54, 120,  78;\n  6: 0, 0,  0, 28, 154, 266,  147;\n  7: 0, 0,  0,  8, 112, 408,  568,  272;\n  8: 0, 0,  0,  0,  45, 360,  999, 1170,  495;\n  9: 0, 0,  0,  0,  10, 200, 1050, 2330, 2350, 890;\n","recurrence_sentence":"The row polynomials satisfy (n+2*n*x+n*x^2)*P(n,x) = -(2*n-4+(10*n-18)*x+(19*n-29)*x^2+(16*n-20)*x^3+(5*n-5)*x^4)*P(n-1,x) + (4*x+17*x^2+27*x^3+19*x^4+5*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 4 + (10*n - 18)*x + (19*n - 29)*x^2 + (16*n - 20)*x^3 + (5*n - 5)*x^4)*P[n - 1, x] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*D[P[n - 1, x], x])/(n + 2*n*x + n*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(2*n - 4 + (10*n - 18)*x + (19*n - 29)*x^2 + (16*n - 20)*x^3 + (5*n - 5)*x^4)*v[i - 1] + (4*x + 17*x^2 + 27*x^3 + 19*x^4 + 5*x^5)*deriv(v[i - 1], x))/(n + 2*n*x + n*x^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-c27b11147fce8bfa","steps":["\u03b8+1","x \u21a6 x/(x+1)"],"edges":["e-0a8a62dc4e77e317","e-972fbf1509bd1c6b"],"text":"A113214 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A113214 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)","chain":null}