{"id":"n-09153823987c7e65","revision":1,"first_index":1,"fingerprint":"f6-d85204b0dfc31b00","name":"Triangle read by rows, related to number of permutations of [n] with 0 successions and k rises.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1","7","1"],["1","21","21","1"],["1","51","161","51","1"],["1","113","813","813","113","1"],["1","239","3361","7631","3361","239","1"],["1","493","12421","53833","53833","12421","493","1"],["1","1003","42865","320107","607009","320107","42865","1003","1"],["1","2025","141549","1704693","5494017","5494017","1704693","141549","2025","1"],["1","4071","453905","8422679","42924113","72605303","42924113","8422679","453905","4071","1"],["1","8165","1426725","39474449","302458313","802028813","802028813","302458313","39474449","1426725","8165","1"],["1","16355","4422913","178065811","1977056433","7789852851","12172272321","7789852851","1977056433","178065811","4422913","16355","1"],["1","32737","13579309","780889437","12218582561","68767041385","158753132437","158753132437","68767041385","12218582561","780889437","13579309","32737","1"],["1","65503","41408833","3352853151","72353683777","564443920415","1847023092289","2722634203807","1847023092289","564443920415","72353683777","3352853151","41408833","65503","1"],["1","131037","125667333","14166996377","414496887689","4378051365013","19673873512333","40944331580049","40944331580049","19673873512333","4378051365013","414496887689","14166996377","125667333","131037","1"],["1","262107","380081105","59131278331","2313653894913","32472283466555","195471226248529","555692780332635","783282749905601","555692780332635","195471226248529","32472283466555","2313653894913","59131278331","380081105","262107","1"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["9","44","265","1854","14833","133496","1334961","14684570","176214841","2290792932","32071101049","481066515734","7697064251745","130850092279664","2355301661033953"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A046739","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1","7","1"],["1","21","21","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158707,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0)","region_exact":null,"edges":["e-460746d5de499dd7"]},{"id":158708,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-460746d5de499dd7"]},{"id":158709,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-460746d5de499dd7"]},{"id":158710,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-460746d5de499dd7"]}],"region_exact":{},"incoming_edges":[{"id":"e-460746d5de499dd7","operation":{"operation":"theorem_check","theorem":"liu_wang_derivative_lag"},"operation_detail":"liu_wang_derivative_lag","conclusion_id":"n-09153823987c7e65","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with the interlacers f' and the lag row (strict form, as in the derivative-lag theorems of the RealRooted library, https://github.com/PerAlexandersson/RealRooted), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":"halfGrowth","lean_declarations":["RealRooted.derivLag_strictInterl_of_nonnegCoeffs","RealRooted.derivLag_strictInterl_and_noCommonRoot","RealRooted.derivLag_eval_zero_pos"],"certificate_hash":"554a790cc5be99bf3c81d6a413525c451f97f5595d43f10676275c00433150cb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-ecadc04944221db5","operation":"gamma_polynomial","operation_detail":"scale 1, shift 0","conclusion_id":"n-c10753d48ae8e3dd","conclusion_name":"gamma_polynomial of Triangle read by rows, related to number of permutations of [n] with 0 successions and k rises."}],"used_by_total":1,"links":[{"id":"l-b1b8b3ad198dd643","kind":"fingerprint_related","node_a_id":"n-09153823987c7e65","node_b_id":"n-b24bb505650436c3","fingerprint":"f6-d85204b0dfc31b00","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d85204b0dfc31b00"},"other_id":"n-b24bb505650436c3","other":{"id":"n-b24bb505650436c3","name":"Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n>=0 and 0<=k<=n.","first_index":1,"fingerprint":"f6-d85204b0dfc31b00","polytool_family":null,"degree_pattern":"irregular","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],[],["0","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","1","7","1"]],"row_sums_preview":["1","0","1","2","9","44","265","1854"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A271697"],"derivation":{"root":"n-b24bb505650436c3","steps":[],"edges":[],"text":"A271697"},"headline":"A271697: Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n>=0 and 0<=k<=n.","chain":null}}],"oeis":[{"oeis_id":"A046739","relation":"tail"}],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1,    7,       1;\n   2: 1,   21,      21,        1;\n   3: 1,   51,     161,       51,         1;\n   4: 1,  113,     813,      813,       113,         1;\n   5: 1,  239,    3361,     7631,      3361,       239,         1;\n   6: 1,  493,   12421,    53833,     53833,     12421,       493,         1;\n   7: 1, 1003,   42865,   320107,    607009,    320107,     42865,      1003,        1;\n   8: 1, 2025,  141549,  1704693,   5494017,   5494017,   1704693,    141549,     2025,       1;\n   9: 1, 4071,  453905,  8422679,  42924113,  72605303,  42924113,   8422679,   453905,    4071,    1;\n  10: 1, 8165, 1426725, 39474449, 302458313, 802028813, 802028813, 302458313, 39474449, 1426725, 8165, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(n+1)*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) + (n+2)*x*P(n-2,x) for n >= 3, with P(1,x) = 1 + 7*x + x^2, P(2,x) = 1 + 21*x + 21*x^2 + x^3.","mathematica":"P[1, x_] := 1 + 7*x + x^2;\nP[2, x_] := 1 + 21*x + 21*x^2 + x^3;\nP[n_, x_] := P[n, x] = Expand[(1 + (n + 1)*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x] + (n + 2)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1 + 7*x + x^2; v[2] = 1 + 21*x + 21*x^2 + x^3; for(n = 3, N, my(i = n); v[i] = (1 + (n + 1)*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x) + (n + 2)*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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-09153823987c7e65","steps":[],"edges":[],"text":"A046739"},"headline":"Triangle read by rows, related to number of permutations of [n] with 0 successions and k rises.","chain":null}