{"id":"n-2b7cd3c06c1326ff","revision":0,"first_index":0,"fingerprint":"f6-b5e14b9c92721dcc","name":"basis_map_A008277 of Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","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"],["4","10","3"],["8","40","28","4"],["16","148","186","60","5"],["32","528","1076","596","110","6"],["64","1848","5788","4936","1526","182","7"],["128","6400","29824","36928","17088","3360","280","8"],["256","22032","149560","259264","168940","48840","6636","408","9"],["512","75584","736752","1744752","1540920","615352","121416","12072","570","10"],["1024","258784","3585936","11400960","13296232","7052200","1896796","271392","20592","770","11"],["2048","884992","17309824","72946432","110251072","75604352","26634928","5144656","557832","33352","1012","12"],["4096","3024448","83077152","459605184","887685328","771825088","346509632","86779056","12608596","1071356","51766","1300","13"],["8192","10331904","397110848","2862894656","6990160928","7593684000","4258614752","1344890080","251399512","28457000","1945372","77532","1638","14"],["16384","35286912","1892764096","17680629376","54113773408","72613318752","50104983600","19552883712","4572177936","661783200","59982208","3369704","112658","2030","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","17","80","415","2348","14351","94016","655945","4847940","37784697","309370512","2652243015","23739576428","221291083991"],"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":{"terms":[{"coeff":{"coeffs":[["0","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-2"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":195988,"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-af4ed26515bda0d2"]},{"id":195989,"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-af4ed26515bda0d2"]},{"id":195990,"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-af4ed26515bda0d2"]}],"region_exact":{},"incoming_edges":[{"id":"e-af4ed26515bda0d2","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-2b7cd3c06c1326ff","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":"9be96059e6c78e6a3b7405399e8f7b251c1f735e70356fe295e0fa198c23441e","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-e8e64448d4c6498a","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","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":[],"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:   4,    10,      3;\n  3:   8,    40,     28,       4;\n  4:  16,   148,    186,      60,       5;\n  5:  32,   528,   1076,     596,     110,      6;\n  6:  64,  1848,   5788,    4936,    1526,    182,      7;\n  7: 128,  6400,  29824,   36928,   17088,   3360,    280,     8;\n  8: 256, 22032, 149560,  259264,  168940,  48840,   6636,   408,   9;\n  9: 512, 75584, 736752, 1744752, 1540920, 615352, 121416, 12072, 570, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(2*x+x^2)*P(n-2,x) - (2*x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (2+2*x)*P(n-1,x) + 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[-(2*x + x^2)*P[n - 2, x] - (2*x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (2 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];\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] = -(2*x + x^2)*v[i - 2] - (2*x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (2 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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-e8e64448d4c6498a","steps":["basis A008277"],"edges":["e-af4ed26515bda0d2"],"text":"A119900 \u2192 basis A008277"},"headline":"A119900 \u2192 basis A008277","chain":null}