{"id":"n-28582b6d055a713a","revision":1,"first_index":0,"fingerprint":"f6-51a257cebd963eda","name":"(10,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"],["10","1"],["10","11","1"],["10","21","12","1"],["10","31","33","13","1"],["10","41","64","46","14","1"],["10","51","105","110","60","15","1"],["10","61","156","215","170","75","16","1"],["10","71","217","371","385","245","91","17","1"],["10","81","288","588","756","630","336","108","18","1"],["10","91","369","876","1344","1386","966","444","126","19","1"],["10","101","460","1245","2220","2730","2352","1410","570","145","20","1"],["10","111","561","1705","3465","4950","5082","3762","1980","715","165","21","1"],["10","121","672","2266","5170","8415","10032","8844","5742","2695","880","186","22","1"],["10","131","793","2938","7436","13585","18447","18876","14586","8437","3575","1066","208","23","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","11","22","44","88","176","352","704","1408","2816","5632","11264","22528","45056","90112"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A093645","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["10","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":169251,"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-1e6e34adbccbc3a8","e-d03b78602db87a59"]},{"id":169252,"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-1e6e34adbccbc3a8","e-905e3e243f3a6ab1","e-d03b78602db87a59"]},{"id":169253,"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-1e6e34adbccbc3a8","e-905e3e243f3a6ab1","e-d03b78602db87a59"]},{"id":169254,"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-d03b78602db87a59"]},{"id":169255,"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-905e3e243f3a6ab1"]},{"id":169256,"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-905e3e243f3a6ab1"]}],"region_exact":{},"incoming_edges":[{"id":"e-1e6e34adbccbc3a8","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-28582b6d055a713a","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":"a21d168e0f3c6c3674b6809e473526f38028071190570be3761924647d615997","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]},{"id":"e-905e3e243f3a6ab1","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-28582b6d055a713a","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":"476190b0ac34704af96557d861b008c50a0f9f32a1b16c65a68e78fb6c385ffe","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-d03b78602db87a59","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-28582b6d055a713a","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":"b6281a2652e074b4cefc442f362e09bed0f7a24060c810d886e3595d24e25c47","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":[{"id":"e-25f29a4734c13fa9","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-31708b25b92d7aac","conclusion_name":"basis_map_A013611 of (10,1) Pascal triangle."},{"id":"e-35c130c218183b03","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-856b6394d4d7e682","conclusion_name":"basis_map_A013609 of (10,1) Pascal triangle."},{"id":"e-76e02a27f2044296","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-49958d807b46898b","conclusion_name":"basis_map_A013610 of (10,1) Pascal triangle."},{"id":"e-8a3dbaecb7aba5e2","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-b2f1b106dd7496f2","conclusion_name":"basis_map_A008277 of (10,1) Pascal triangle."},{"id":"e-d8d81e3e13cdd7d1","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-2f02c090d42e1cb9","conclusion_name":"basis_map_A007318 of (10,1) Pascal triangle."}],"used_by_total":5,"links":[{"id":"l-23e59b324b6f6317","kind":"oeis_match","node_a_id":"n-28582b6d055a713a","node_b_id":null,"fingerprint":null,"oeis_id":"A093645","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":"A093645","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9aa77728a23f2cbc","kind":"oeis_match","node_a_id":"n-28582b6d055a713a","node_b_id":null,"fingerprint":null,"oeis_id":"A005015","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":"A005015","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A093645","relation":"identification"},{"oeis_id":"A005015","relation":"match_row_sums"},{"oeis_id":"A093645","relation":"match_triangle"}],"bfiles":[{"node_id":"n-28582b6d055a713a","oeis_id":"A005015","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":31,"oeis_terms_available":31,"term_count":200,"raw_size":7189},{"node_id":"n-28582b6d055a713a","oeis_id":"A093645","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":11324}],"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: 10,  1;\n  2: 10, 11,   1;\n  3: 10, 21,  12,   1;\n  4: 10, 31,  33,  13,   1;\n  5: 10, 41,  64,  46,  14,   1;\n  6: 10, 51, 105, 110,  60,  15,   1;\n  7: 10, 61, 156, 215, 170,  75,  16,   1;\n  8: 10, 71, 217, 371, 385, 245,  91,  17,  1;\n  9: 10, 81, 288, 588, 756, 630, 336, 108, 18, 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) = 10 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 10 + 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] = 10 + 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":"A093645","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: 10,  1;\n  2: 10, 11,   1;\n  3: 10, 21,  12,   1;\n  4: 10, 31,  33,  13,   1;\n  5: 10, 41,  64,  46,  14,   1;\n  6: 10, 51, 105, 110,  60,  15,   1;\n  7: 10, 61, 156, 215, 170,  75,  16,   1;\n  8: 10, 71, 217, 371, 385, 245,  91,  17,  1;\n  9: 10, 81, 288, 588, 756, 630, 336, 108, 18, 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) = 10 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 10 + 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] = 10 + 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-28582b6d055a713a","steps":[],"edges":[],"text":"A093645"},"headline":"A093645: (10,1) Pascal triangle.","chain":null}