{"id":"n-49a7d6c7beaa24e5","revision":0,"first_index":0,"fingerprint":"f6-fd14f22a5134cfe6","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of k-matchings in the n-sunlet graph (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"],["2","3"],["6","18","9"],["14","63","81","27"],["34","204","414","324","81"],["82","615","1710","2160","1215","243"],["198","1782","6291","11016","9963","4374","729"],["478","5019","21483","48195","60669","42525","15309","2187"],["1154","13848","69660","190728","308934","301320","172044","52488","6561"],["2786","37611","217404","703080","1395306","1753974","1390932","669222","177147","19683"],["6726","100890","658845","2458080","5780970","8921988","9119790","6079860","2525985","590490","59049"],["16238","267927","1950597","8247987","22440726","41126778","51658398","44361108","25476363","9310059","1948617","177147"],["39202","705636","5666490","26782380","82780623","175840632","262582884","277136640","204801615","103217652","33657930","6377292","531441"],["94642","1845519","16204266","84664008","293093073","708472089","1227726396","1541358234","1399572837","906579297","406847610","119751372","20726199","1594323"],["228486","4798206","45728487","261722664","1003305933","2720405898","5370973839","7830780948","8459431911","6729499602","3876743997","1567396656","420369831","66961566","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","33","185","1057","6025","34353","195865","1116737","6367145","36302673","206981945","1180120417","6728529865","38363130993"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"],["6","18","9"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-6"],["1","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-4","-6"],["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201676,"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-652a96bcfd281fc4"]},{"id":201677,"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-652a96bcfd281fc4"]},{"id":201678,"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-652a96bcfd281fc4"]},{"id":201679,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-652a96bcfd281fc4"]}],"region_exact":{},"incoming_edges":[{"id":"e-652a96bcfd281fc4","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-49a7d6c7beaa24e5","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":"4c6097b4d8cc9c4f76785a62511c0d6d46b2775e4df06da4a47f020bfaf1b8a7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-9d2e609ab19d361f","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings in the n-sunlet graph (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:    2,     3;\n  2:    6,    18,      9;\n  3:   14,    63,     81,     27;\n  4:   34,   204,    414,    324,      81;\n  5:   82,   615,   1710,   2160,    1215,     243;\n  6:  198,  1782,   6291,  11016,    9963,    4374,     729;\n  7:  478,  5019,  21483,  48195,   60669,   42525,   15309,   2187;\n  8: 1154, 13848,  69660, 190728,  308934,  301320,  172044,  52488,   6561;\n  9: 2786, 37611, 217404, 703080, 1395306, 1753974, 1390932, 669222, 177147, 19683;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x)*P(n-2,x) + (2*n-4+(3*n-6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 3*x, P(2,x) = 6 + 18*x + 9*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 3*x;\nP[2, x_] := 6 + 18*x + 9*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x)*P[n - 2, x] + (2*n - 4 + (3*n - 6)*x)*P[n - 1, x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; v[3] = 6 + 18*x + 9*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x)*v[i - 2] + (2*n - 4 + (3*n - 6)*x)*v[i - 1])/(n - 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-9d2e609ab19d361f","steps":["basis A013610"],"edges":["e-652a96bcfd281fc4"],"text":"A102413 \u2192 basis A013610"},"headline":"A102413 \u2192 basis A013610","chain":null}