{"id":"n-6364333ec046b88e","revision":0,"first_index":0,"fingerprint":"f6-32bac27798a7a126","name":"basis_map_A008277 of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; 0 <= k <= n/2).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2"],["10","6"],["20","12"],["100","156","36"],["200","312","72"],["1000","3096","1728","216"],["2000","6192","3456","432"],["10000","55536","56592","16416","1296"],["20000","111072","113184","32832","2592"],["100000","948576","1578240","799200","142560","7776"],["200000","1897152","3156480","1598400","285120","15552"],["1000000","15777216","40412736","31847040","9642240","1166400","46656"],["2000000","31554432","80825472","63694080","19284480","2332800","93312"],["10000000","258435456","983743488","1134193536","518918400","104509440","9144576","279936"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","16","32","292","584","6040","12080","139840","279680","3576352","7152704","99892288","199784576","3019224832"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["10","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","6"]]},"deriv_order":1,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196354,"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-9e1633f5dad1cfbf"]},{"id":196355,"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-9e1633f5dad1cfbf"]},{"id":196356,"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-9e1633f5dad1cfbf"]}],"region_exact":{},"incoming_edges":[{"id":"e-9e1633f5dad1cfbf","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-6364333ec046b88e","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":"acb40e62ec54c68953b9ecee78939454b72615cea5c74ff26b5d7732083154b2","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-a9e3a6c6145e13ca","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; 0 <= k <= n/2).","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-153e54943ce453b2","kind":"fingerprint_related","node_a_id":"n-835678969d153601","node_b_id":"n-6364333ec046b88e","fingerprint":"f6-32bac27798a7a126","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-32bac27798a7a126"},"other_id":"n-835678969d153601","other":{"id":"n-835678969d153601","name":"basis_map_A008277 of basis_map_A013610 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-32bac27798a7a126","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["5","3"]],"card_rows":[["1"],["1"],["5","3"],["5","3"]],"row_sums_preview":["1","1","8","8","73","73","755","755"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013610","basis A008277"],"edges":["e-c6857bd156c16708","e-3b00454b031341bf"],"text":"A152198 \u2192 basis A013610 \u2192 basis A008277"},"headline":"A152198 \u2192 basis A013610 \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;\n  2:    10,      6;\n  3:    20,     12;\n  4:   100,    156,     36;\n  5:   200,    312,     72;\n  6:  1000,   3096,   1728,   216;\n  7:  2000,   6192,   3456,   432;\n  8: 10000,  55536,  56592, 16416, 1296;\n  9: 20000, 111072, 113184, 32832, 2592;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (10+6*x)*P(n-2,x) + 6*x*d/dx P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[(10 + 6*x)*P[n - 2, x] + 6*x*D[P[n - 2, 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; for(n = 2, N, my(i = n + 1); v[i] = (10 + 6*x)*v[i - 2] + 6*x*deriv(v[i - 2], 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-b6aca576a689e9f0","steps":["basis A013610","basis A008277"],"edges":["e-4e3482570d7ce009","e-9e1633f5dad1cfbf"],"text":"A274496 \u2192 basis A013610 \u2192 basis A008277"},"headline":"A274496 \u2192 basis A013610 \u2192 basis A008277","chain":null}
