{"id":"n-2b301932743053f0","revision":1,"first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","name":"basis_map_A013609 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":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["2"],["4","4"],["8","8"],["16","32","16"],["32","64","32"],["64","192","192","64"],["128","384","384","128"],["256","1024","1536","1024","256"],["512","2048","3072","2048","512"],["1024","5120","10240","10240","5120","1024"],["2048","10240","20480","20480","10240","2048"],["4096","24576","61440","81920","61440","24576","4096"],["8192","49152","122880","163840","122880","49152","8192"],["16384","114688","344064","573440","573440","344064","114688","16384"]],"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:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":166307,"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-267456e89d3343d1"]},{"id":166308,"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-267456e89d3343d1"]},{"id":166309,"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-267456e89d3343d1"]}],"region_exact":{},"incoming_edges":[{"id":"e-267456e89d3343d1","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-2b301932743053f0","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":"741e3ae4c4099cc41372069ff0d294615101b82ca328cd33a640bf613c21ba37","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-b6aca576a689e9f0","role":"sequence","name":"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-231d713753f4a773","kind":"fingerprint_related","node_a_id":"n-35bd700768cac55f","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-35bd700768cac55f","other":{"id":"n-35bd700768cac55f","name":"Triangle read by rows: triangle of repeated stepped binomial coefficients.","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","0","1","1"]],"row_sums_preview":["1","1","2","2","4","4","8","8"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A103633"],"derivation":{"root":"n-35bd700768cac55f","steps":[],"edges":[],"text":"A103633"},"headline":"A103633: Triangle read by rows: triangle of repeated stepped binomial coefficients.","chain":null}},{"id":"l-38b224a4189dae59","kind":"fingerprint_related","node_a_id":"n-b6aca576a689e9f0","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-b6aca576a689e9f0","other":{"id":"n-b6aca576a689e9f0","name":"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).","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"half_affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2"],["2","2"]],"card_rows":[["1"],["2"],["2","2"],["4","4"]],"row_sums_preview":["1","2","4","8","16","32","64","128"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A274496"],"derivation":{"root":"n-b6aca576a689e9f0","steps":[],"edges":[],"text":"A274496"},"headline":"A274496: 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).","chain":null}},{"id":"l-61322ce8c37107e8","kind":"fingerprint_related","node_a_id":"n-b7506a83efd6007f","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-b7506a83efd6007f","other":{"id":"n-b7506a83efd6007f","name":"basis_map_A013609 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"half_affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["2","2"]],"card_rows":[["1"],["1"],["2","2"],["2","2"]],"row_sums_preview":["1","1","4","4","16","16","64","64"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013609"],"edges":["e-500dd9b78517f374"],"text":"A152198 \u2192 basis A013609"},"headline":"A152198 \u2192 basis A013609","chain":null}},{"id":"l-d5c2ad6fbcd8e5ea","kind":"fingerprint_related","node_a_id":"n-507d474f4c2321e5","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-507d474f4c2321e5","other":{"id":"n-507d474f4c2321e5","name":"derivative 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).","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"half_affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[[],[],["2"]],"card_rows":[["2"],["4"],["8","8"],["16","16"]],"row_sums_preview":["0","0","2","4","16","32","96","192"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b6aca576a689e9f0","steps":["D"],"edges":["e-5c70b541165ff56b"],"text":"A274496 \u2192 D"},"headline":"A274496 \u2192 D","chain":null}},{"id":"l-d75d72d57d466743","kind":"fingerprint_related","node_a_id":"n-4124f4242e7d4c67","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-4124f4242e7d4c67","other":{"id":"n-4124f4242e7d4c67","name":"Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"half_affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["1","1"]],"card_rows":[["1"],["1"],["1","1"],["1","1"]],"row_sums_preview":["1","1","2","2","4","4","8","8"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A152198","A152815"],"derivation":{"root":"n-4124f4242e7d4c67","steps":[],"edges":[],"text":"A152198"},"headline":"A152198: Triangle read by rows, A007318 rows repeated.","chain":null}},{"id":"l-e3153c3ee8befee0","kind":"fingerprint_related","node_a_id":"n-688648772a3128e6","node_b_id":"n-2b301932743053f0","fingerprint":"f6-6052c7b42ebfb2ec","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6052c7b42ebfb2ec"},"other_id":"n-688648772a3128e6","other":{"id":"n-688648772a3128e6","name":"derivative of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-6052c7b42ebfb2ec","polytool_family":null,"degree_pattern":"half_affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[[],[],["1"]],"card_rows":[["1"],["1"],["2","2"],["2","2"]],"row_sums_preview":["0","0","1","1","4","4","12","12"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["D"],"edges":["e-598ca892414d6ed7"],"text":"A152198 \u2192 D"},"headline":"A152198 \u2192 D","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:   4,    4;\n  3:   8,    8;\n  4:  16,   32,   16;\n  5:  32,   64,   32;\n  6:  64,  192,  192,   64;\n  7: 128,  384,  384,  128;\n  8: 256, 1024, 1536, 1024, 256;\n  9: 512, 2048, 3072, 2048, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4+4*x)*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[(4 + 4*x)*P[n - 2, 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] = (4 + 4*x)*v[i - 2]); 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 A013609"],"edges":["e-267456e89d3343d1"],"text":"A274496 \u2192 basis A013609"},"headline":"A274496 \u2192 basis A013609","chain":null}