{"id":"n-fd2095bd14a92d5d","revision":0,"first_index":0,"fingerprint":"f6-f51bd8e56ed79f3c","name":"shift_x_plus_one of shift_x_plus_one 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":true,"rows":[["1"],["2"],["6","2"],["12","4"],["36","24","4"],["72","48","8"],["216","216","72","8"],["432","432","144","16"],["1296","1728","864","192","16"],["2592","3456","1728","384","32"],["7776","12960","8640","2880","480","32"],["15552","25920","17280","5760","960","64"],["46656","93312","77760","34560","8640","1152","64"],["93312","186624","155520","69120","17280","2304","128"],["279936","653184","653184","362880","120960","24192","2688","128"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","8","16","64","128","512","1024","4096","8192","32768","65536","262144","524288","2097152"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","-1"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","-8","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172941,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-8e38c083dc895a86"]},{"id":172942,"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-8e38c083dc895a86"]},{"id":172943,"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-8e38c083dc895a86"]}],"region_exact":{},"incoming_edges":[{"id":"e-8e38c083dc895a86","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-fd2095bd14a92d5d","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"440d56448f377996bacf4249f0f75d9a7862ebe34834b4e27d4f7937ccaa7ec4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-d321ff0d3bb39024","role":"sequence","name":"shift_x_plus_one 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-8f3487813f87b6cd","kind":"fingerprint_related","node_a_id":"n-a0fdad46da122da1","node_b_id":"n-fd2095bd14a92d5d","fingerprint":"f6-f51bd8e56ed79f3c","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f51bd8e56ed79f3c"},"other_id":"n-a0fdad46da122da1","other":{"id":"n-a0fdad46da122da1","name":"shift_x_plus_one of shift_x_plus_one of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-f51bd8e56ed79f3c","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["3","1"]],"card_rows":[["1"],["1"],["3","1"],["3","1"]],"row_sums_preview":["1","1","4","4","16","16","64","64"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["x \u21a6 x+1","x \u21a6 x+1"],"edges":["e-009b68c8336dc2e0","e-08843e8088d0d99c"],"text":"A152198 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1"},"headline":"A152198 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1","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:    6,    2;\n  3:   12,    4;\n  4:   36,   24,    4;\n  5:   72,   48,    8;\n  6:  216,  216,   72,   8;\n  7:  432,  432,  144,  16;\n  8: 1296, 1728,  864, 192, 16;\n  9: 2592, 3456, 1728, 384, 32;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n+1+(n-1)*x)*P(n-1,x) - (6+8*x+2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(n + 1 + (n - 1)*x)*P[n - 1, x] - (6 + 8*x + 2*x^2)*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 1 + (n - 1)*x)*v[i - 1] - (6 + 8*x + 2*x^2)*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-b6aca576a689e9f0","steps":["x \u21a6 x+1","x \u21a6 x+1"],"edges":["e-5428ec8f88838d6b","e-8e38c083dc895a86"],"text":"A274496 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1"},"headline":"A274496 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1","chain":null}