{"id":"n-316742a6512c57a1","revision":0,"first_index":0,"fingerprint":"f6-22e87c6bce817021","name":"basis_map_A013609 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","2"],["6","12","4"],["14","42","36","8"],["34","136","184","96","16"],["82","410","760","640","240","32"],["198","1188","2796","3264","1968","576","64"],["478","3346","9548","14280","11984","5600","1344","128"],["1154","9232","30960","56512","61024","39680","15104","3072","256"],["2786","25074","96624","208320","275616","230976","122112","39168","6912","512"],["6726","67260","292820","728320","1141920","1174912","800640","355840","98560","15360","1024"],["16238","178618","866932","2443848","4432736","5415872","4535168","2596352","994048","242176","33792","2048"],["39202","470424","2518440","7935520","16351728","23155968","23052544","16220160","7991040","2684928","583680","73728","4096"],["94642","1230346","7201896","25085632","57894928","93296736","107783936","90212096","54609152","23582208","7055360","1384448","159744","8192"],["228486","3198804","20323772","77547456","198183888","358242752","471525824","458317312","330073856","175049728","67228672","18120704","3239936","344064","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","22","100","466","2164","10054","46708","216994","1008100","4683382","21757828","101081458","469599316","2181641638"],"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","2"],["6","12","4"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-2","-4"],["1","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-4","-4"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":198893,"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-da7b699520f3e308"]},{"id":198894,"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-da7b699520f3e308"]},{"id":198895,"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-da7b699520f3e308"]},{"id":198896,"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-da7b699520f3e308"]}],"region_exact":{},"incoming_edges":[{"id":"e-da7b699520f3e308","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-316742a6512c57a1","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":"551baaa72ba4aea1c1a145e0387a542dd3466a188522146321922edd223ddb04","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,     2;\n  2:    6,    12,     4;\n  3:   14,    42,    36,      8;\n  4:   34,   136,   184,     96,     16;\n  5:   82,   410,   760,    640,    240,     32;\n  6:  198,  1188,  2796,   3264,   1968,    576,     64;\n  7:  478,  3346,  9548,  14280,  11984,   5600,   1344,   128;\n  8: 1154,  9232, 30960,  56512,  61024,  39680,  15104,  3072,  256;\n  9: 2786, 25074, 96624, 208320, 275616, 230976, 122112, 39168, 6912, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n-2+(2*n-4)*x)*P(n-2,x) + (2*n-4+(2*n-4)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 2*x, P(2,x) = 6 + 12*x + 4*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[2, x_] := 6 + 12*x + 4*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (2*n - 4)*x)*P[n - 2, x] + (2*n - 4 + (2*n - 4)*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 + 2*x; v[3] = 6 + 12*x + 4*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (2*n - 4)*x)*v[i - 2] + (2*n - 4 + (2*n - 4)*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 A013609"],"edges":["e-da7b699520f3e308"],"text":"A102413 \u2192 basis A013609"},"headline":"A102413 \u2192 basis A013609","chain":null}