{"id":"n-3005506063937011","revision":0,"first_index":0,"fingerprint":"f6-9b02f85dc5a0184c","name":"basis_map_A013609 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","4"],["4","14","12"],["8","40","64","32"],["16","104","244","240","80"],["32","256","792","1168","800","192"],["64","608","2336","4600","4816","2464","448"],["128","1408","6464","15936","22528","17920","7168","1024"],["256","3200","17088","50624","90256","97920","61824","19968","2304"],["512","7168","43648","151040","325280","448064","389376","201216","53760","5120"],["1024","15872","108544","429696","1085120","1814240","2014144","1444608","625152","140800","11264"],["2048","34816","264192","1177600","3412352","6714240","9088000","8374784","5068800","1869824","360448","24576"],["4096","75776","631808","3131392","10241536","23188864","37064000","41816320","32690944","16986112","5417984","905216","53248"],["8192","163840","1488896","8122368","29596672","75808768","139805568","186855680","179545600","121099264","54765568","15282176","2236416","114688"],["16384","352256","3465216","20633600","82892800","236995584","495502336","766050176","874625280","727733760","429192192","170846208","42119168","5447680","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","30","144","684","3240","15336","72576","343440","1625184","7690464","36391680","172207296","814893696","3856118400"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-2","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":198700,"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-fa60549745d63218"]},{"id":198701,"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-fa60549745d63218"]},{"id":198702,"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-fa60549745d63218"]}],"region_exact":{},"incoming_edges":[{"id":"e-fa60549745d63218","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-3005506063937011","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":"b9c7bd2a06ceb512909c5f334de0077e925bd7716922d84daa8263144ad5d29a","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,    4;\n  2:   4,   14,    12;\n  3:   8,   40,    64,     32;\n  4:  16,  104,   244,    240,     80;\n  5:  32,  256,   792,   1168,    800,    192;\n  6:  64,  608,  2336,   4600,   4816,   2464,    448;\n  7: 128, 1408,  6464,  15936,  22528,  17920,   7168,   1024;\n  8: 256, 3200, 17088,  50624,  90256,  97920,  61824,  19968,  2304;\n  9: 512, 7168, 43648, 151040, 325280, 448064, 389376, 201216, 53760, 5120;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(2*x+4*x^2)*P(n-2,x) + (2+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(2*x + 4*x^2)*P[n - 2, x] + (2 + 4*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; v[2] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(2*x + 4*x^2)*v[i - 2] + (2 + 4*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}}],"derivation":{"root":"n-e8e64448d4c6498a","steps":["basis A013609"],"edges":["e-fa60549745d63218"],"text":"A119900 \u2192 basis A013609"},"headline":"A119900 \u2192 basis A013609","chain":null}