{"id":"n-4a145153652b996f","revision":0,"first_index":0,"fingerprint":"f6-a874cbd3a72814db","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","1"],["3","2"],["8","10","3"],["13","18","6"],["44","88","57","12"],["75","158","108","24"],["308","844","849","372","60"],["541","1530","1590","720","120"],["2612","9076","12405","8340","2760","360"],["4683","16622","23220","15960","5400","720"],["25988","109300","188913","171780","86700","23040","2520"],["47293","201978","354606","327600","168000","45360","5040"],["296564","1463428","3058797","3510612","2389800","965160","214200","20160"],["545835","2724878","5762988","6693624","4611600","1884960","423360","40320"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","3","5","21","37","201","365","2433","4501","35553","66605","608241","1149877","11918721","22687565"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3","1"]]},"deriv_order":1,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172338,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-a489be38a6c900af"]},{"id":172339,"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-a489be38a6c900af"]},{"id":172340,"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-a489be38a6c900af"]}],"region_exact":{},"incoming_edges":[{"id":"e-a489be38a6c900af","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-4a145153652b996f","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"6ad1f2041483b883bf76b3807cb7abc0095d4468123cd7463be2aaf18c0f6d1e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-f1291d4c6c67167e","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors.","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,    1;\n  2:    3,    2;\n  3:    8,   10,     3;\n  4:   13,   18,     6;\n  5:   44,   88,    57,   12;\n  6:   75,  158,   108,   24;\n  7:  308,  844,   849,  372,   60;\n  8:  541, 1530,  1590,  720,  120;\n  9: 2612, 9076, 12405, 8340, 2760, 360;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3+2*x)*P(n-2,x) + (2+3*x+x^2)*d/dx P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 2, x] + (2 + 3*x + x^2)*D[P[n - 2, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 2] + (2 + 3*x + x^2)*deriv(v[i - 2], x)); 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-f1291d4c6c67167e","steps":["x \u21a6 x+1"],"edges":["e-a489be38a6c900af"],"text":"A305540 \u2192 x \u21a6 x+1"},"headline":"A305540 \u2192 x \u21a6 x+1","chain":null}