{"id":"n-8cd21ebd6c5c32f0","revision":1,"first_index":0,"fingerprint":"f6-49d880ced4b36b3a","name":"one_plus_derivative of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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":true,"rows":[["3"],["9","3"],["24","18","3"],["60","72","27","3"],["144","240","144","36","3"],["336","720","600","240","45","3"],["768","2016","2160","1200","360","54","3"],["1728","5376","7056","5040","2100","504","63","3"],["3840","13824","21504","18816","10080","3360","672","72","3"],["8448","34560","62208","64512","42336","18144","5040","864","81","3"],["18432","84480","172800","207360","161280","84672","30240","7200","1080","90","3"],["39936","202752","464640","633600","570240","354816","155232","47520","9900","1320","99","3"],["86016","479232","1216512","1858560","1900800","1368576","709632","266112","71280","13200","1584","108","3"],["184320","1118208","3115008","5271552","6040320","4942080","2965248","1317888","432432","102960","17160","1872","117","3"],["393216","2580480","7827456","14536704","18450432","16912896","11531520","5930496","2306304","672672","144144","21840","2184","126","3"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","12","45","162","567","1944","6561","21870","72171","236196","767637","2480058","7971615","25509168","81310473"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"]],"recurrence":{"denominator":{"coeffs":[["1","1"],["1","0"]]},"terms":[{"coeff":{"coeffs":[["4","4","1"],["2","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164112,"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-879e9fec43b0fba4"]},{"id":164113,"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-879e9fec43b0fba4"]},{"id":164114,"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-879e9fec43b0fba4"]},{"id":164115,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-879e9fec43b0fba4"]}],"region_exact":{},"incoming_edges":[{"id":"e-879e9fec43b0fba4","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-8cd21ebd6c5c32f0","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"7d92aa10ee8358b644bc191df6009cb5fcfff0e22a2ea5ea02ee2fcf95fcede3","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":"unordered"}],"premises":[{"position":0,"node_id":"n-51b4f5e7901c2b50","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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-0e475d0b89e3a579","kind":"fingerprint_related","node_a_id":"n-4b03a2849503b9e9","node_b_id":"n-8cd21ebd6c5c32f0","fingerprint":"f6-49d880ced4b36b3a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-49d880ced4b36b3a"},"other_id":"n-4b03a2849503b9e9","other":{"id":"n-4b03a2849503b9e9","name":"shift_x_plus_one of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.","first_index":0,"fingerprint":"f6-49d880ced4b36b3a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","1"],["8","6","1"]],"card_rows":[["1"],["3","1"],["8","6","1"],["20","24","9","1"]],"row_sums_preview":["1","4","15","54","189","648","2187","7290"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8c19eba9d68881f","steps":["D+1","x \u21a6 x+1"],"edges":["e-5c65a1a70531c253","e-09eb0f66de37936d"],"text":"A007318 \u2192 D+1 \u2192 x \u21a6 x+1"},"headline":"A007318 \u2192 D+1 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-5a11df1ffde2753f","kind":"fingerprint_related","node_a_id":"n-878bf8921be6069e","node_b_id":"n-8cd21ebd6c5c32f0","fingerprint":"f6-49d880ced4b36b3a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-49d880ced4b36b3a"},"other_id":"n-878bf8921be6069e","other":{"id":"n-878bf8921be6069e","name":"one_plus_derivative of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-49d880ced4b36b3a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","1"],["8","6","1"]],"card_rows":[["1"],["3","1"],["8","6","1"],["20","24","9","1"]],"row_sums_preview":["1","4","15","54","189","648","2187","7290"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["D+1"],"edges":["e-ecf027aa2d377831"],"text":"A038207 \u2192 D+1"},"headline":"A038207 \u2192 D+1","chain":null}},{"id":"l-820eb808c58fbb62","kind":"fingerprint_related","node_a_id":"n-f4f57d2aaca23cda","node_b_id":"n-8cd21ebd6c5c32f0","fingerprint":"f6-49d880ced4b36b3a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-49d880ced4b36b3a"},"other_id":"n-f4f57d2aaca23cda","other":{"id":"n-f4f57d2aaca23cda","name":"mobius_x_over_x_plus_one of Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1's elsewhere.","first_index":0,"fingerprint":"f6-49d880ced4b36b3a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","3"],["1","6","8"]],"card_rows":[["1"],["1","3"],["1","6","8"],["1","9","24","20"]],"row_sums_preview":["1","4","15","54","189","648","2187","7290"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8c19eba9d68881f","steps":["\u03b8+1","x \u21a6 x/(x+1)"],"edges":["e-a112169ce63438eb","e-e68d80e1d57e8e24"],"text":"A007318 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A007318 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-cf4fef966fa0d3c8","kind":"oeis_match","node_a_id":"n-8cd21ebd6c5c32f0","node_b_id":null,"fingerprint":null,"oeis_id":"A064017","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":"A064017","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A064017","relation":"match_row_sums"}],"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:    3;\n  1:    9,     3;\n  2:   24,    18,     3;\n  3:   60,    72,    27,     3;\n  4:  144,   240,   144,    36,     3;\n  5:  336,   720,   600,   240,    45,     3;\n  6:  768,  2016,  2160,  1200,   360,    54,    3;\n  7: 1728,  5376,  7056,  5040,  2100,   504,   63,   3;\n  8: 3840, 13824, 21504, 18816, 10080,  3360,  672,  72,  3;\n  9: 8448, 34560, 62208, 64512, 42336, 18144, 5040, 864, 81, 3;\n","recurrence_sentence":"The row polynomials satisfy (n+1+x)*P(n,x) = (2*n+4+(n+4)*x+x^2)*P(n-1,x) for n >= 1, with P(0,x) = 3.","mathematica":"P[0, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n + 4 + (n + 4)*x + x^2)*P[n - 1, x])/(n + 1 + x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 4 + (n + 4)*x + x^2)*v[i - 1])/(n + 1 + x)); 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-51b4f5e7901c2b50","steps":["D+1"],"edges":["e-879e9fec43b0fba4"],"text":"A120910 \u2192 D+1"},"headline":"A120910 \u2192 D+1","chain":null}