{"id":"n-ec4e74470f457c51","revision":1,"first_index":0,"fingerprint":"f6-0b755df1db877c9f","name":"shift_x_plus_one of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.","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","1"],["6","5","1"],["22","25","9","1"],["94","133","67","14","1"],["454","761","485","145","20","1"],["2430","4677","3571","1370","275","27","1"],["14214","30745","27181","12621","3290","476","35","1"],["89918","215173","215195","116606","37121","7042","770","44","1"],["610182","1596217","1775589","1095193","409752","95655","13818","1182","54","1"],["4412798","12501189","15269731","10529570","4510255","1245153","222747","25320","1740","65","1"],["33827974","102995289","136757533","103999621","50042630","15899290","3381609","478467","43890","2475","77","1"],["273646526","889843973","1274023147","1057096678","563248301","201916968","49650700","8390052","961917","72655","3421","90","1"],["2326980998","8039271033","12328516629","11065492945","6455756164","2572475477","716583296","140551840","19317012","1829542","115687","4615","104","1"],["20732504062","75758860613","123746295219","119302030666","75524784699","33062084055","10272867605","2290622048","366653716","41755714","3319316","178178","6097","119","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","12","57","309","1866","12351","88563","681870","5597643","48718569","447428856","4318854429","43666895343","461101962108"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164809,"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-7bde779ad89b066e"]},{"id":164810,"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-7bde779ad89b066e"]},{"id":164811,"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-7bde779ad89b066e"]}],"region_exact":{},"incoming_edges":[{"id":"e-7bde779ad89b066e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-ec4e74470f457c51","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":"fed91c63f8b301cd557c6f55e418908634d43815f725c762e7baba9c4ccb69f6","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-c15181c2ebe13c1d","role":"sequence","name":"Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished.","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":[{"id":"l-a7182d3ca9180254","kind":"oeis_match","node_a_id":"n-ec4e74470f457c51","node_b_id":null,"fingerprint":null,"oeis_id":"A027710","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A027710","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A027710","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-ec4e74470f457c51","oeis_id":"A027710","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":22,"oeis_terms_available":22,"term_count":200,"raw_size":28222}],"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:      6,       5,       1;\n  3:     22,      25,       9,       1;\n  4:     94,     133,      67,      14,      1;\n  5:    454,     761,     485,     145,     20,     1;\n  6:   2430,    4677,    3571,    1370,    275,    27,     1;\n  7:  14214,   30745,   27181,   12621,   3290,   476,    35,    1;\n  8:  89918,  215173,  215195,  116606,  37121,  7042,   770,   44,  1;\n  9: 610182, 1596217, 1775589, 1095193, 409752, 95655, 13818, 1182, 54, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (2+x)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 1, x] + (2 + x)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + x)*v[i - 1] + (2 + x)*deriv(v[i - 1], 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-6fea5aff4f44fa54","steps":["basis A049020","x \u21a6 x+1"],"edges":["e-2ff0affdc4d5d50d","e-7bde779ad89b066e"],"text":"A023531 \u2192 basis A049020 \u2192 x \u21a6 x+1"},"headline":"A023531 \u2192 basis A049020 \u2192 x \u21a6 x+1","chain":null}