{"id":"n-30c1f9894979624d","revision":1,"first_index":0,"fingerprint":"f6-663eee055a9b8dbd","name":"(8,1) 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"],["8","1"],["8","9","1"],["8","17","10","1"],["8","25","27","11","1"],["8","33","52","38","12","1"],["8","41","85","90","50","13","1"],["8","49","126","175","140","63","14","1"],["8","57","175","301","315","203","77","15","1"],["8","65","232","476","616","518","280","92","16","1"],["8","73","297","708","1092","1134","798","372","108","17","1"],["8","81","370","1005","1800","2226","1932","1170","480","125","18","1"],["8","89","451","1375","2805","4026","4158","3102","1650","605","143","19","1"],["8","97","540","1826","4180","6831","8184","7260","4752","2255","748","162","20","1"],["8","105","637","2366","6006","11011","15015","15444","12012","7007","3003","910","182","21","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","18","36","72","144","288","576","1152","2304","4608","9216","18432","36864","73728"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A093565","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["8","1"]],"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":169239,"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-84570a434b1515d5","e-c1a7dd654ec0298c"]},{"id":169240,"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-566d844085516f12","e-84570a434b1515d5","e-c1a7dd654ec0298c"]},{"id":169241,"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-566d844085516f12","e-84570a434b1515d5","e-c1a7dd654ec0298c"]},{"id":169242,"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-c1a7dd654ec0298c"]},{"id":169243,"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-566d844085516f12"]},{"id":169244,"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-566d844085516f12"]}],"region_exact":{},"incoming_edges":[{"id":"e-566d844085516f12","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-30c1f9894979624d","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":"7c3f6f4497be2dbc1306a2a7bd36c8752c2975a31d5e93bcfca576fb5a7e935c","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":[]},{"id":"e-84570a434b1515d5","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-30c1f9894979624d","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":"21407581a24fe33f3a463f27ac2672c201c3d86cb7a9c2593f7b3dda9b2d2508","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]},{"id":"e-c1a7dd654ec0298c","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-30c1f9894979624d","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":"ff5d96f1c254d0d102108d1772f2d38ae9a6ae57cbaa95fa7f32c0bab9f517a8","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":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-057d5d3eac0782a3","kind":"oeis_match","node_a_id":"n-30c1f9894979624d","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":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A005010","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6d6ca1cfe00aa60b","kind":"oeis_match","node_a_id":"n-30c1f9894979624d","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":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A116453","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-89dbd656249d7459","kind":"oeis_match","node_a_id":"n-30c1f9894979624d","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":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A288135","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a903690f54a3d305","kind":"oeis_match","node_a_id":"n-30c1f9894979624d","node_b_id":null,"fingerprint":null,"oeis_id":"A093565","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":70},"in_catalog":true,"oeis_id":"A093565","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A093565","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":"A093565","relation":"match_triangle"}],"bfiles":[{"node_id":"n-30c1f9894979624d","oeis_id":"A005010","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":32,"oeis_terms_available":32,"term_count":200,"raw_size":7171},{"node_id":"n-30c1f9894979624d","oeis_id":"A093565","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":70,"oeis_terms_agreeing":70,"oeis_terms_available":70,"term_count":990,"raw_size":11217}],"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: 8,  1;\n  2: 8,  9,   1;\n  3: 8, 17,  10,   1;\n  4: 8, 25,  27,  11,   1;\n  5: 8, 33,  52,  38,  12,   1;\n  6: 8, 41,  85,  90,  50,  13,   1;\n  7: 8, 49, 126, 175, 140,  63,  14,  1;\n  8: 8, 57, 175, 301, 315, 203,  77, 15,  1;\n  9: 8, 65, 232, 476, 616, 518, 280, 92, 16, 1;\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) = 8 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 8 + 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] = 8 + 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":"A093565","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: 8,  1;\n  2: 8,  9,   1;\n  3: 8, 17,  10,   1;\n  4: 8, 25,  27,  11,   1;\n  5: 8, 33,  52,  38,  12,   1;\n  6: 8, 41,  85,  90,  50,  13,   1;\n  7: 8, 49, 126, 175, 140,  63,  14,  1;\n  8: 8, 57, 175, 301, 315, 203,  77, 15,  1;\n  9: 8, 65, 232, 476, 616, 518, 280, 92, 16, 1;\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) = 8 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 8 + 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] = 8 + 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-30c1f9894979624d","steps":[],"edges":[],"text":"A093565"},"headline":"A093565: (8,1) Pascal triangle.","chain":null}