{"id":"n-703053a921044202","revision":0,"first_index":0,"fingerprint":"f6-0aeeb4be61492791","name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 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"],["3","4"],["9","22","12"],["27","94","100","32"],["81","364","572","368","80"],["243","1336","2772","2688","1200","192"],["729","4738","12208","15848","10816","3616","448"],["2187","16402","50480","82184","75840","39200","10304","1024"],["6561","55768","199560","390912","455728","321024","131712","28160","2304"],["19683","186988","762712","1746848","2464016","2205632","1241472","417792","74496","5120"],["59049","620014","2839268","7445072","12332560","13417504","9644224","4478208","1266432","192000","11264"],["177147","2037190","10348332","30572592","58186544","74611872","65432640","38964992","15282432","3700224","484352","24576"],["531441","6643012","37068004","121832816","262011360","387165504","401410112","292620544","147744256","49843200","10486784","1200128","53248"],["1594323","21523360","130867340","473646752","1135988192","1901462208","2277587136","1968184320","1220091392","531694592","156535808","28966912","2928640","114688"],["4782969","69353050","456374952","1803577848","4773236784","8928905664","12140928576","12148101504","8948506368","4800666624","1831425024","476116992","78274560","7053312","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","43","253","1465","8431","48403","277621","1591729","9124759","52305595","299822893","1718610409","9851185663","56467549987"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-6","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199141,"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-5db4e5a3fc67f912"]},{"id":199142,"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-5db4e5a3fc67f912"]},{"id":199143,"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-5db4e5a3fc67f912"]},{"id":199144,"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-5db4e5a3fc67f912"]}],"region_exact":{},"incoming_edges":[{"id":"e-5db4e5a3fc67f912","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-703053a921044202","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":"003cf99a5c05c6b3b844416f960df7db3abc737d7bb006f62b27bb1676c8e7e7","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-b1a7dcc8610d7e32","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 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:     3,      4;\n  2:     9,     22,     12;\n  3:    27,     94,    100,      32;\n  4:    81,    364,    572,     368,      80;\n  5:   243,   1336,   2772,    2688,    1200,     192;\n  6:   729,   4738,  12208,   15848,   10816,    3616,     448;\n  7:  2187,  16402,  50480,   82184,   75840,   39200,   10304,   1024;\n  8:  6561,  55768, 199560,  390912,  455728,  321024,  131712,  28160,  2304;\n  9: 19683, 186988, 762712, 1746848, 2464016, 2205632, 1241472, 417792, 74496, 5120;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3+6*x+4*x^2)*P(n-2,x) + (4+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[-(3 + 6*x + 4*x^2)*P[n - 2, x] + (4 + 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] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 6*x + 4*x^2)*v[i - 2] + (4 + 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-b1a7dcc8610d7e32","steps":["basis A013609"],"edges":["e-5db4e5a3fc67f912"],"text":"A330381 \u2192 basis A013609"},"headline":"A330381 \u2192 basis A013609","chain":null}