{"id":"n-a920b56c9b3ef4d1","revision":2,"first_index":0,"fingerprint":"f6-d23628de2a16b138","name":"Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j.","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"],["100","20","1"],["1000","300","30","1"],["10000","4000","600","40","1"],["100000","50000","10000","1000","50","1"],["1000000","600000","150000","20000","1500","60","1"],["10000000","7000000","2100000","350000","35000","2100","70","1"],["100000000","80000000","28000000","5600000","700000","56000","2800","80","1"],["1000000000","900000000","360000000","84000000","12600000","1260000","84000","3600","90","1"],["10000000000","10000000000","4500000000","1200000000","210000000","25200000","2100000","120000","4500","100","1"],["100000000000","110000000000","55000000000","16500000000","3300000000","462000000","46200000","3300000","165000","5500","110","1"],["1000000000000","1200000000000","660000000000","220000000000","49500000000","7920000000","924000000","79200000","4950000","220000","6600","120","1"],["10000000000000","13000000000000","7800000000000","2860000000000","715000000000","128700000000","17160000000","1716000000","128700000","7150000","286000","7800","130","1"],["100000000000000","140000000000000","91000000000000","36400000000000","10010000000000","2002000000000","300300000000","34320000000","3003000000","200200000","10010000","364000","9100","140","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","11","121","1331","14641","161051","1771561","19487171","214358881","2357947691","25937424601","285311670611","3138428376721","34522712143931","379749833583241"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A038303","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["10","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158537,"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-628c0d5ad874b82a"]},{"id":158538,"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-28dc2c43b415fad4","e-628c0d5ad874b82a","e-a5624f2627681b92"]},{"id":158539,"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-28dc2c43b415fad4","e-628c0d5ad874b82a","e-a5624f2627681b92"]},{"id":158540,"position":3,"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-628c0d5ad874b82a"]},{"id":158541,"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-28dc2c43b415fad4","e-a5624f2627681b92"]},{"id":158542,"position":5,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, +inf)","output_interval":"(-inf, +inf)","statement":"every real-rooted input has a real-rooted image (an affine substitution times g)"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, +inf) to roots in (-inf, +inf): every real-rooted input has a real-rooted image (an affine substitution times g)","region_exact":null,"edges":["e-6e20efd59ad59f31"]},{"id":158543,"position":6,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"(-inf, 10]","output_interval":"(-inf, 0]","statement":"an input root r <= 10 gives the root (r - a)/d <= 0; a larger root gives a positive root"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in (-inf, 10] to roots in (-inf, 0]: an input root r <= 10 gives the root (r - a)/d <= 0; a larger root gives a positive root","region_exact":null,"edges":["e-6e20efd59ad59f31"]}],"region_exact":{},"incoming_edges":[{"id":"e-28dc2c43b415fad4","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-a920b56c9b3ef4d1","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"54c6def9da39e71c6d619e5c4c1a39248753e699cf8291ad435a6ba8323fef0d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-3dd184aba99388f7","role":"sequence","name":"Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.","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]"}]},{"id":"e-6e20efd59ad59f31","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-a920b56c9b3ef4d1","premise_count":0,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"9a4f5d433519320d760196872c4842d91db692169d728770f0405211ed731684","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, +inf)","output_interval":"(-inf, +inf)","statement":"every real-rooted input has a real-rooted image (an affine substitution times g)"},{"claim":"basis_map_preserver","input_interval":"(-inf, 10]","output_interval":"(-inf, 0]","statement":"an input root r <= 10 gives the root (r - a)/d <= 0; a larger root gives a positive root"}],"premises":[]},{"id":"e-a5624f2627681b92","operation":{"operation":"parent_provers","route":"periodic_product"},"operation_detail":"periodic_product","conclusion_id":"n-a920b56c9b3ef4d1","premise_count":0,"theorem":"polytool parent provers, route periodic_product: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"f468523003ae353237a1dea6be849801851be13683103816e9103b8df644dd08","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-628c0d5ad874b82a","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-a920b56c9b3ef4d1","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":"09b570dbf83369fb3c20e61221ca07eff3686c45632ab298a5278d2e204d614e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-254f1b828fe6620e","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-3c11bfaa4e68c9bc","conclusion_name":"basis_map_A013610 of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-34d290d6207a0155","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-31f0871ac8eccdd6","conclusion_name":"basis_map_A007318 of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-551d764375152d3c","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-e03395d80bc5749d","conclusion_name":"basis_map_A013611 of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-697c46cc77488b97","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-e854c41b6a4f44ff","conclusion_name":"basis_map_A008277 of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-71aa91d8d70f875b","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-10f70e3ea8b205cf","conclusion_name":"basis_map_A013609 of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-e361768fdb02a8d8","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-37c70c80fa31c1b5","conclusion_name":"obreschkoff_combination of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."},{"id":"e-e361768fdb02a8d8","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-37c70c80fa31c1b5","conclusion_name":"obreschkoff_combination of Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j."}],"used_by_total":7,"links":[{"id":"l-0f83d0e67f879d63","kind":"oeis_match","node_a_id":"n-a920b56c9b3ef4d1","node_b_id":null,"fingerprint":null,"oeis_id":"A038303","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":39},"in_catalog":true,"oeis_id":"A038303","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-28460ec30dee59ca","kind":"oeis_match","node_a_id":"n-a920b56c9b3ef4d1","node_b_id":null,"fingerprint":null,"oeis_id":"A001020","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":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001020","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-924558fbbdf56ca6","kind":"oeis_match","node_a_id":"n-a920b56c9b3ef4d1","node_b_id":null,"fingerprint":null,"oeis_id":"A013617","in_catalog":0,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":false,"oeis_id":"A013617","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A038303","relation":"identification"},{"oeis_id":"A013617","relation":"match_reversed_triangle"},{"oeis_id":"A001020","relation":"match_row_sums"},{"oeis_id":"A038303","relation":"match_triangle"}],"bfiles":[{"node_id":"n-a920b56c9b3ef4d1","oeis_id":"A001020","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":21716},{"node_id":"n-a920b56c9b3ef4d1","oeis_id":"A013617","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":24851},{"node_id":"n-a920b56c9b3ef4d1","oeis_id":"A038303","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":39,"oeis_terms_agreeing":39,"oeis_terms_available":39,"term_count":990,"raw_size":24851}],"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:        100,        20,         1;\n  3:       1000,       300,        30,        1;\n  4:      10000,      4000,       600,       40,        1;\n  5:     100000,     50000,     10000,     1000,       50,       1;\n  6:    1000000,    600000,    150000,    20000,     1500,      60,     1;\n  7:   10000000,   7000000,   2100000,   350000,    35000,    2100,    70,    1;\n  8:  100000000,  80000000,  28000000,  5600000,   700000,   56000,  2800,   80,  1;\n  9: 1000000000, 900000000, 360000000, 84000000, 12600000, 1260000, 84000, 3600, 90, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (10+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(10 + x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (10 + x)*v[i - 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":"A013617","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1, 10;\n  2: 1, 20,  100;\n  3: 1, 30,  300,  1000;\n  4: 1, 40,  600,  4000,   10000;\n  5: 1, 50, 1000, 10000,   50000,   100000;\n  6: 1, 60, 1500, 20000,  150000,   600000,  1000000;\n  7: 1, 70, 2100, 35000,  350000,  2100000,  7000000,  10000000;\n  8: 1, 80, 2800, 56000,  700000,  5600000, 28000000,  80000000, 100000000;\n  9: 1, 90, 3600, 84000, 1260000, 12600000, 84000000, 360000000, 900000000, 1000000000;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (10+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(10 + x)*P[n - 1, x]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (10 + x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(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":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A038303","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:        100,        20,         1;\n  3:       1000,       300,        30,        1;\n  4:      10000,      4000,       600,       40,        1;\n  5:     100000,     50000,     10000,     1000,       50,       1;\n  6:    1000000,    600000,    150000,    20000,     1500,      60,     1;\n  7:   10000000,   7000000,   2100000,   350000,    35000,    2100,    70,    1;\n  8:  100000000,  80000000,  28000000,  5600000,   700000,   56000,  2800,   80,  1;\n  9: 1000000000, 900000000, 360000000, 84000000, 12600000, 1260000, 84000, 3600, 90, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (10+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(10 + x)*P[n - 1, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (10 + x)*v[i - 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-a920b56c9b3ef4d1","steps":[],"edges":[],"text":"A038303"},"headline":"A038303: Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j.","chain":null}