{"id":"n-ad285e734b9b3fbb","revision":0,"first_index":0,"fingerprint":"f6-e88a2f797c4f541a","name":"basis_map_A013611 of basis_map_A007318 of Square the entries of Pascal's triangle.","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"],["3","4"],["13","32","16"],["63","228","240","64"],["321","1536","2496","1536","256"],["1683","10020","22080","21760","8960","1024"],["8989","64032","178320","243200","165120","49152","4096"],["48639","403396","1358448","2372160","2266880","1139712","258048","16384"],["265729","2514944","9936640","21174272","26199040","18808832","7340032","1310720","65536"],["1462563","15554628","70541568","177558528","270240768","253661184","143130624","44826624","6488064","262144"],["8097453","95600160","489425040","1421383680","2570695680","2989228032","2224373760","1018429440","262471680","31457280","1048576"],["45046719","584585892","3334581360","10977384000","23014210560","31972233216","29660725248","18047631360","6866534400","1485045760","149946368","4194304"],["251595969","3559712256","22387197888","82390894080","196533469440","317843767296","354006073344","270085128192","137514516480","44291850240","8166309888","704643072","16777216"],["1409933619","21599884644","148478990400","604149841152","1616066200320","2983918519296","3883910823936","3573409382400","2293251637248","994706718720","275301531648","43838865408","3271557120","67108864"],["7923848253","130672946208","974715011088","4345149838848","12883529987328","26751699566592","39880227459072","43033520504832","33440842186752","18370529329152","6886586843136","1658025148416","230535725056","15032385536","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","61","595","6145","65527","712909","7863667","87615745","983726695","11112210781","126142119187","1437751935361","16443380994775","188609259215725"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","8","16"],["-1","-8","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-4"],["6","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":205274,"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-028dec7ea7c416eb"]},{"id":205275,"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-028dec7ea7c416eb"]},{"id":205276,"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-028dec7ea7c416eb"]},{"id":205277,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-028dec7ea7c416eb"]}],"region_exact":{},"incoming_edges":[{"id":"e-028dec7ea7c416eb","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-ad285e734b9b3fbb","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":"b70bbc9f630c0e267cd9bc1969a30ed2b2c92e9bee76820918168849d20489bb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-57c367574a30fd7b","role":"sequence","name":"basis_map_A007318 of Square the entries of Pascal's triangle.","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-1d278d7d50aa409b","kind":"fingerprint_related","node_a_id":"n-e1b5185a7301abc6","node_b_id":"n-ad285e734b9b3fbb","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-e1b5185a7301abc6","other":{"id":"n-e1b5185a7301abc6","name":"basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["13","32","16"],["63","228","240","64"],["321","1536","2496","1536","256"]],"card_rows":[["13","32","16"],["63","228","240","64"],["321","1536","2496","1536","256"],["1683","10020","22080","21760","8960","1024"]],"row_sums_preview":["61","595","6145","65527","712909","7863667","87615745","983726695"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609"],"edges":["e-060b1f8a928003b3"],"text":"A133214 \u2192 basis A013609"},"headline":"A133214 \u2192 basis A013609","chain":null}},{"id":"l-6e9a7da7b1aea054","kind":"fingerprint_related","node_a_id":"n-6373ae06480cbab5","node_b_id":"n-ad285e734b9b3fbb","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-6373ae06480cbab5","other":{"id":"n-6373ae06480cbab5","name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","first_index":1,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["13","32","16"]],"card_rows":[["1"],["3","4"],["13","32","16"],["63","228","240","64"]],"row_sums_preview":["1","7","61","595","6145","65527","712909","7863667"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013611"],"edges":["e-99f7e1fd97b5ca9c"],"text":"A104684 \u2192 basis A013611"},"headline":"A104684 \u2192 basis A013611","chain":null}},{"id":"l-f6d1b2a1275496fa","kind":"fingerprint_related","node_a_id":"n-82c3c8329527823d","node_b_id":"n-ad285e734b9b3fbb","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-82c3c8329527823d","other":{"id":"n-82c3c8329527823d","name":"reversal of basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["16","32","13"],["64","240","228","63"],["256","1536","2496","1536","321"]],"card_rows":[["16","32","13"],["64","240","228","63"],["256","1536","2496","1536","321"],["1024","8960","21760","22080","10020","1683"]],"row_sums_preview":["61","595","6145","65527","712909","7863667","87615745","983726695"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609","reverse"],"edges":["e-060b1f8a928003b3","e-1bafbf22543673ac"],"text":"A133214 \u2192 basis A013609 \u2192 reverse"},"headline":"A133214 \u2192 basis A013609 \u2192 reverse","chain":null}},{"id":"l-fdf233470da6d0a9","kind":"fingerprint_related","node_a_id":"n-3bf3b2c1960395d5","node_b_id":"n-ad285e734b9b3fbb","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-3bf3b2c1960395d5","other":{"id":"n-3bf3b2c1960395d5","name":"reversal of basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","first_index":1,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","3"],["16","32","13"]],"card_rows":[["1"],["4","3"],["16","32","13"],["64","240","228","63"]],"row_sums_preview":["1","7","61","595","6145","65527","712909","7863667"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013611","reverse"],"edges":["e-99f7e1fd97b5ca9c","e-6bcef3ca45ff1e76"],"text":"A104684 \u2192 basis A013611 \u2192 reverse"},"headline":"A104684 \u2192 basis A013611 \u2192 reverse","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:       3,        4;\n  2:      13,       32,       16;\n  3:      63,      228,      240,        64;\n  4:     321,     1536,     2496,      1536,       256;\n  5:    1683,    10020,    22080,     21760,      8960,      1024;\n  6:    8989,    64032,   178320,    243200,    165120,     49152,      4096;\n  7:   48639,   403396,  1358448,   2372160,   2266880,   1139712,    258048,    16384;\n  8:  265729,  2514944,  9936640,  21174272,  26199040,  18808832,   7340032,  1310720,   65536;\n  9: 1462563, 15554628, 70541568, 177558528, 270240768, 253661184, 143130624, 44826624, 6488064, 262144;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = -(n-1+(8*n-8)*x+(16*n-16)*x^2)*P(n-2,x) + (6*n-3+(8*n-4)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1 + (8*n - 8)*x + (16*n - 16)*x^2)*P[n - 2, x] + (6*n - 3 + (8*n - 4)*x)*P[n - 1, x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1 + (8*n - 8)*x + (16*n - 16)*x^2)*v[i - 2] + (6*n - 3 + (8*n - 4)*x)*v[i - 1])/(n)); 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-b13531ad79e7c629","steps":["x \u21a6 x+1","basis A013611"],"edges":["e-041c07f9bf4043d7","e-028dec7ea7c416eb"],"text":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013611"},"headline":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013611","chain":null}