{"id":"n-bd5fa5857f8c49a3","revision":0,"first_index":0,"fingerprint":"f6-a546e680aefa4794","name":"basis_map_A008277 of Triangle read by rows: The convolution triangle of 2^n, where the convolution triangle of a sequence is defined in A357368.","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":false,"rows":[["1"],["2","2"],["8","16","4"],["32","112","64","8"],["128","736","736","208","16"],["512","4672","7360","3552","608","32"],["2048","29056","68224","50240","14400","1664","64"],["8192","178432","603904","638848","273280","52096","4352","128"],["32768","1086976","5188096","7596288","4557056","1275904","173824","11008","256"],["131072","6587392","43678720","86339072","69877248","26976768","5332992","545792","27136","512"],["524288","39786496","362604544","950748160","1011205120","517429248","139281408","20490240","1634304","65536","1024"],["2097152","239767552","2980409344","10232690688","14035957760","9266419712","3263361024","647387136","73666560","4710400","155648","2048"],["8388608","1442799616","24322809856","108287725568","188896874496","157801791488","70746615808","18179690496","2768105472","250961920","13156352","364544","4096"],["33554432","8673574912","197468078080","1131522875392","2483337945088","2587018829824","1447549435904","468727660544","91721490432","11057373184","817676288","35790848","843776","8192"],["134217728","52108558336","1597091774464","11710164910080","32063101091840","41184939507712","28334828634112","11332196761600","2771885129728","426705190912","41738977280","2565914624","95207424","1933312","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","28","216","1824","16736","165696","1759232","19922176","239496704","3043770368","40746625024","572719288320","8427965136896","129517557825536"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-2"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196459,"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":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-b992ac0a9b57400a"]},{"id":196460,"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-b992ac0a9b57400a"]},{"id":196461,"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-b992ac0a9b57400a"]}],"region_exact":{},"incoming_edges":[{"id":"e-b992ac0a9b57400a","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-bd5fa5857f8c49a3","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"a677b4371ad2e070137ed802d1bae4c0681b030b018a30d069434eb1859d1f18","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-ff74e25052457f18","role":"sequence","name":"Triangle read by rows: The convolution triangle of 2^n, where the convolution triangle of a sequence is defined in A357368.","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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-b8ca2f431068cace","kind":"fingerprint_related","node_a_id":"n-fdeb1554f3b02f13","node_b_id":"n-bd5fa5857f8c49a3","fingerprint":"f6-a546e680aefa4794","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a546e680aefa4794"},"other_id":"n-fdeb1554f3b02f13","other":{"id":"n-fdeb1554f3b02f13","name":"basis_map_A008277 of Triangle read by rows, T(n,k) = (n+1)*binomial(n-1,k-1).","first_index":0,"fingerprint":"f6-a546e680aefa4794","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["6","12","3"]],"card_rows":[["1"],["2","2"],["6","12","3"],["16","56","32","4"]],"row_sums_preview":["1","4","21","108","570","3138","18123","109952"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-a88a7983f557eac4","steps":["basis A008277"],"edges":["e-f9832e6a5c7b3771"],"text":"A127952 \u2192 basis A008277"},"headline":"A127952 \u2192 basis A008277","chain":null}},{"id":"l-ef93ba2f8b99117c","kind":"fingerprint_related","node_a_id":"n-5ecf178bc343139f","node_b_id":"n-bd5fa5857f8c49a3","fingerprint":"f6-a546e680aefa4794","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a546e680aefa4794"},"other_id":"n-5ecf178bc343139f","other":{"id":"n-5ecf178bc343139f","name":"basis_map_A008277 of Number of compositions of n with k parts, T(n, k) = binomial(n-1, k-1) for n, k >= 1 and T(n, 0) = 0^n, triangle read by rows for n >= 0 and 0 <= k <= n.","first_index":0,"fingerprint":"f6-a546e680aefa4794","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["2","4","1"]],"card_rows":[["1"],["1","1"],["2","4","1"],["4","14","8","1"]],"row_sums_preview":["1","2","7","27","114","523","2589","13744"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-3783f6df357ea675","steps":["basis A008277"],"edges":["e-1354b132e491ca6c"],"text":"A097805 \u2192 basis A008277"},"headline":"A097805 \u2192 basis A008277","chain":null}}],"oeis":[],"bfiles":[],"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:      2,       2;\n  2:      8,      16,        4;\n  3:     32,     112,       64,        8;\n  4:    128,     736,      736,      208,       16;\n  5:    512,    4672,     7360,     3552,      608,       32;\n  6:   2048,   29056,    68224,    50240,    14400,     1664,      64;\n  7:   8192,  178432,   603904,   638848,   273280,    52096,    4352,    128;\n  8:  32768, 1086976,  5188096,  7596288,  4557056,  1275904,  173824,  11008,   256;\n  9: 131072, 6587392, 43678720, 86339072, 69877248, 26976768, 5332992, 545792, 27136, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(2*n-2)*x)*P(n-1,x) + (2*n-2)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (2*n - 2)*x)*P[n - 1, x] + (2*n - 2)*x*D[P[n - 1, x], 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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 4 + (2*n - 2)*x)*v[i - 1] + (2*n - 2)*x*deriv(v[i - 1], x))/(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}}],"derivation":{"root":"n-ff74e25052457f18","steps":["basis A008277"],"edges":["e-b992ac0a9b57400a"],"text":"A380114 \u2192 basis A008277"},"headline":"A380114 \u2192 basis A008277","chain":null}