{"id":"n-adf2bd240d57cc59","revision":1,"first_index":0,"fingerprint":"f6-dfaabd2e84538026","name":"(9,11) Pascal triangle.","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":[["1"],["9","11"],["9","20","11"],["9","29","31","11"],["9","38","60","42","11"],["9","47","98","102","53","11"],["9","56","145","200","155","64","11"],["9","65","201","345","355","219","75","11"],["9","74","266","546","700","574","294","86","11"],["9","83","340","812","1246","1274","868","380","97","11"],["9","92","423","1152","2058","2520","2142","1248","477","108","11"],["9","101","515","1575","3210","4578","4662","3390","1725","585","119","11"],["9","110","616","2090","4785","7788","9240","8052","5115","2310","704","130","11"],["9","119","726","2706","6875","12573","17028","17292","13167","7425","3014","834","141","11"],["9","128","845","3432","9581","19448","29601","34320","30459","20592","10439","3848","975","152","11"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","20","40","80","160","320","640","1280","2560","5120","10240","20480","40960","81920","163840"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A172185","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["9","11"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-1"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169599,"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":false,"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-217c9192bf3be863","e-9c11cad3e65d5355"]},{"id":169600,"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-217c9192bf3be863","e-9c11cad3e65d5355","e-b691c0e3e996a57d"]},{"id":169601,"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-217c9192bf3be863","e-9c11cad3e65d5355","e-b691c0e3e996a57d"]},{"id":169602,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-217c9192bf3be863"]},{"id":169603,"position":4,"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-b691c0e3e996a57d"]},{"id":169604,"position":5,"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-b691c0e3e996a57d"]}],"region_exact":{},"incoming_edges":[{"id":"e-217c9192bf3be863","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-adf2bd240d57cc59","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 g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"c7987042e6a62429853ca1abbdec9d991f812e582dfb82766a58379ecba907e8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-9c11cad3e65d5355","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-adf2bd240d57cc59","premise_count":0,"theorem":"Row-hypergeometric rows: an exact row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, proved for every n by an invariant row-annihilator system of the rule, writes every row as U_0(n) x^v (or its reversal) times the image of (1 + x)^M(n) under a product of nonnegative multiplier sequences: C^k (C > 0); k -> M'!/(M' - k)!, whose exponential generating function is (1 + x)^M' (Polya--Schur, Theorem 7.1 (3) => (1) of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601: a sequence is a multiplier sequence when G(x) = sum_k lambda_k x^k / k! or G(-x) can be written C x^m e^(a x) prod_k (1 + alpha_k x) with a >= 0, alpha_k >= 0); k -> phi(k) for a polynomial phi with only real roots, all <= 0 (Laguerre's theorem, RealRooted isPFMultiplierSequence_eval_of_roots_nonpos); k -> 1/(alpha)_k for alpha > 0 (RealRooted isPFMultiplierSequence_inv_ascPochhammer, via the generalized Laguerre polynomials); products of PF multiplier sequences are PF multiplier sequences (RealRooted IsPFMultiplierSequence.mul) and map real-rooted polynomials with nonnegative coefficients to such polynomials (IsPFMultiplierSequence.diagonalOperator_isPF)","lean_route":null,"lean_declarations":["RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_inv_ascPochhammer","RealRooted.IsPFMultiplierSequence.mul","RealRooted.IsPFMultiplierSequence.diagonalOperator_isPF"],"certificate_hash":"2251676a5f4502fa89d8eefc464dcf1b0ee25796a51cad043fe40dfe6b327f1c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]},{"id":"e-b691c0e3e996a57d","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-adf2bd240d57cc59","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":"be835af47791342232af33b214f0247a60cb91673d3ebbb4abdefc414a52f5c6","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":[],"used_by_total":0,"links":[{"id":"l-02f9aefefed760ee","kind":"oeis_match","node_a_id":"n-adf2bd240d57cc59","node_b_id":null,"fingerprint":null,"oeis_id":"A146523","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":0,"oeis_term_position":3,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A146523","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-25628f965944adfe","kind":"oeis_match","node_a_id":"n-adf2bd240d57cc59","node_b_id":null,"fingerprint":null,"oeis_id":"A020714","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":0,"oeis_term_position":2,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A020714","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6078589539d7e805","kind":"oeis_match","node_a_id":"n-adf2bd240d57cc59","node_b_id":null,"fingerprint":null,"oeis_id":"A172185","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A172185","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c416879bbdb2de2e","kind":"oeis_match","node_a_id":"n-adf2bd240d57cc59","node_b_id":null,"fingerprint":null,"oeis_id":"A323831","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":0,"oeis_term_position":2,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A323831","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A172185","relation":"identification"},{"oeis_id":"A020714","relation":"match_row_sums"},{"oeis_id":"A146523","relation":"match_row_sums"},{"oeis_id":"A323831","relation":"match_row_sums"},{"oeis_id":"A172185","relation":"match_triangle"}],"bfiles":[{"node_id":"n-adf2bd240d57cc59","oeis_id":"A172185","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":11602}],"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: 9, 11;\n  2: 9, 20,  11;\n  3: 9, 29,  31,  11;\n  4: 9, 38,  60,  42,   11;\n  5: 9, 47,  98, 102,   53,   11;\n  6: 9, 56, 145, 200,  155,   64,  11;\n  7: 9, 65, 201, 345,  355,  219,  75,  11;\n  8: 9, 74, 266, 546,  700,  574, 294,  86, 11;\n  9: 9, 83, 340, 812, 1246, 1274, 868, 380, 97, 11;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 9 + 11*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 9 + 11*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 9 + 11*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1])/(n - 1)); 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":"A172185","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: 9, 11;\n  2: 9, 20,  11;\n  3: 9, 29,  31,  11;\n  4: 9, 38,  60,  42,   11;\n  5: 9, 47,  98, 102,   53,   11;\n  6: 9, 56, 145, 200,  155,   64,  11;\n  7: 9, 65, 201, 345,  355,  219,  75,  11;\n  8: 9, 74, 266, 546,  700,  574, 294,  86, 11;\n  9: 9, 83, 340, 812, 1246, 1274, 868, 380, 97, 11;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 9 + 11*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 9 + 11*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];\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] = 9 + 11*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1])/(n - 1)); 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}}],"derivation":{"root":"n-adf2bd240d57cc59","steps":[],"edges":[],"text":"A172185"},"headline":"A172185: (9,11) Pascal triangle.","chain":null}