{"id":"n-53e8412f57bfc9da","revision":0,"first_index":0,"fingerprint":"f6-b57915851b3a9ea7","name":"basis_map_A013610 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","6"],["9","33","27"],["27","141","225","108"],["81","546","1287","1242","405"],["243","2004","6237","9072","6075","1458"],["729","7107","27468","53487","54756","27459","5103"],["2187","24603","113580","277371","383940","297675","117369","17496"],["6561","83652","449010","1319328","2307123","2437776","1500282","481140","59049"],["19683","280482","1716102","5895612","12474081","16749018","14141142","7138368","1909251","196830"],["59049","930021","6388353","25127118","62433585","101889171","109853739","76514382","32457267","7381125","649539"],["177147","3055785","23283747","103182498","294569379","566583903","745318665","665753418","391672017","142249041","27930177","2125764"],["531441","9964518","83403009","411185754","1326432510","2940038046","4572312057","4999696326","3786523686","1916140050","604720809","103808142","6908733"],["1594323","32285040","294451515","1598557788","5750940222","14439228642","25943140971","33628274280","31269607902","20440126278","9026643483","2505567168","379980315","22320522"],["4782969","104029575","1026843642","6087075237","24164511219","67803877386","138292764561","207561703041","229340430783","184553752266","105609195549","41182957413","10155837510","1372712103","71744535"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","69","501","3561","25089","176109","1234221","8643921","60520569","423683349","2965901541","20761665081","145332718449","1017332217789"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-9","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201930,"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-157ba4fb1203ab53"]},{"id":201931,"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-157ba4fb1203ab53"]},{"id":201932,"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-157ba4fb1203ab53"]},{"id":201933,"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-157ba4fb1203ab53"]}],"region_exact":{},"incoming_edges":[{"id":"e-157ba4fb1203ab53","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-53e8412f57bfc9da","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":"524e94e52e44b3c3a7e1f9a6e91831edc328eaea9252a5b43fa2b4518ef873c6","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,      6;\n  2:     9,     33,      27;\n  3:    27,    141,     225,     108;\n  4:    81,    546,    1287,    1242,      405;\n  5:   243,   2004,    6237,    9072,     6075,     1458;\n  6:   729,   7107,   27468,   53487,    54756,    27459,     5103;\n  7:  2187,  24603,  113580,  277371,   383940,   297675,   117369,   17496;\n  8:  6561,  83652,  449010, 1319328,  2307123,  2437776,  1500282,  481140,   59049;\n  9: 19683, 280482, 1716102, 5895612, 12474081, 16749018, 14141142, 7138368, 1909251, 196830;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3+9*x+9*x^2)*P(n-2,x) + (4+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 6*x;\nP[n_, x_] := P[n, x] = Expand[-(3 + 9*x + 9*x^2)*P[n - 2, x] + (4 + 6*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 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 9*x + 9*x^2)*v[i - 2] + (4 + 6*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 A013610"],"edges":["e-157ba4fb1203ab53"],"text":"A330381 \u2192 basis A013610"},"headline":"A330381 \u2192 basis A013610","chain":null}