{"id":"n-c15181c2ebe13c1d","revision":2,"first_index":0,"fingerprint":"f6-fdf6b18bd9ec2fbc","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.","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"],["1","1"],["2","3","1"],["5","10","6","1"],["15","37","31","10","1"],["52","151","160","75","15","1"],["203","674","856","520","155","21","1"],["877","3263","4802","3556","1400","287","28","1"],["4140","17007","28337","24626","11991","3290","490","36","1"],["21147","94828","175896","174805","101031","34671","6972","786","45","1"],["115975","562595","1146931","1279240","853315","350889","88977","13620","1200","55","1"],["678570","3535027","7841108","9677151","7300260","3492511","1069068","207537","24915","1760","66","1"],["4213597","23430840","56089804","75750752","63641006","34669734","12428746","2928684","447612","43175","2497","78","1"],["27644437","163254885","418952508","613656836","567304452","346231886","142171744","39439114","7345767","904332","71500","3445","91","1"],["190899322","1192059223","3261082917","5142797660","5181338526","3497726232","1617507892","516450792","113690005","17104087","1728727","113932","4641","105","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","6","22","94","454","2430","14214","89918","610182","4412798","33827974","273646526","2326980998","20732504062"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A049020","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160037,"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-2ff0affdc4d5d50d","e-bcbfbcbb753a93dd"]},{"id":160038,"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-2ff0affdc4d5d50d","e-bcbfbcbb753a93dd"]},{"id":160039,"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-2ff0affdc4d5d50d","e-bcbfbcbb753a93dd"]}],"region_exact":{},"incoming_edges":[{"id":"e-2ff0affdc4d5d50d","operation":{"map":"A049020","operation":"basis_map"},"operation_detail":"A049020","conclusion_id":"n-c15181c2ebe13c1d","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"f8e3649361ce95670af2a508cf6a563f694912f2bde832121c477732c2966d96","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-6fea5aff4f44fa54","role":"sequence","name":"a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.","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]"}]},{"id":"e-bcbfbcbb753a93dd","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-c15181c2ebe13c1d","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":"01467da03f8d861a9fde153ef8f9b26beec1e59a1b4ce7070fa7ebc47d1b8237","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-e65f982fa1b436c5","role":"sequence","name":"Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 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":[{"id":"e-2a8c271a42a52261","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-c826b75746f15e6c","conclusion_name":"reversal 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."},{"id":"e-3568a4fde56c4654","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-be4c56aa8cc909cd","conclusion_name":"mobius_x_over_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."},{"id":"e-7bde779ad89b066e","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-ec4e74470f457c51","conclusion_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."},{"id":"e-9acfc4c7c0e80a75","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-bdae5aa3d1cac0ec","conclusion_name":"Triangle read by rows: A008277 * A007318."},{"id":"e-eab8cb537bb9fa58","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-8ef7930015acb081","conclusion_name":"derivative 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."}],"used_by_total":5,"links":[{"id":"l-f97981477b8e24f9","kind":"fingerprint_related","node_a_id":"n-c15181c2ebe13c1d","node_b_id":"n-c826b75746f15e6c","fingerprint":"f6-fdf6b18bd9ec2fbc","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fdf6b18bd9ec2fbc"},"other_id":"n-c826b75746f15e6c","other":{"id":"n-c826b75746f15e6c","name":"reversal 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.","first_index":0,"fingerprint":"f6-fdf6b18bd9ec2fbc","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","3","2"]],"card_rows":[["1"],["1","1"],["1","3","2"],["1","6","10","5"]],"row_sums_preview":["1","2","6","22","94","454","2430","14214"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6fea5aff4f44fa54","steps":["basis A049020","reverse"],"edges":["e-2ff0affdc4d5d50d","e-2a8c271a42a52261"],"text":"A023531 \u2192 basis A049020 \u2192 reverse"},"headline":"A023531 \u2192 basis A049020 \u2192 reverse","chain":null}},{"id":"l-9b264d169f7ff5ce","kind":"oeis_match","node_a_id":"n-c15181c2ebe13c1d","node_b_id":null,"fingerprint":null,"oeis_id":"A049020","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A049020","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-a668327541ab09a5","kind":"oeis_match","node_a_id":"n-c15181c2ebe13c1d","node_b_id":null,"fingerprint":null,"oeis_id":"A001861","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":"A001861","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A049020","relation":"identification"},{"oeis_id":"A001861","relation":"match_row_sums"},{"oeis_id":"A049020","relation":"match_triangle"}],"bfiles":[{"node_id":"n-c15181c2ebe13c1d","oeis_id":"A001861","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":24,"oeis_terms_available":24,"term_count":200,"raw_size":27053},{"node_id":"n-c15181c2ebe13c1d","oeis_id":"A049020","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":24060}],"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:     1,     1;\n  2:     2,     3,      1;\n  3:     5,    10,      6,      1;\n  4:    15,    37,     31,     10,      1;\n  5:    52,   151,    160,     75,     15,     1;\n  6:   203,   674,    856,    520,    155,    21,    1;\n  7:   877,  3263,   4802,   3556,   1400,   287,   28,   1;\n  8:  4140, 17007,  28337,  24626,  11991,  3290,  490,  36,  1;\n  9: 21147, 94828, 175896, 174805, 101031, 34671, 6972, 786, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (1+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[(1 + x)*P[n - 1, x] + (1 + 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] = (1 + x)*v[i - 1] + (1 + 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}},{"oeis_id":"A049020","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:     1;\n  1:     1,     1;\n  2:     2,     3,      1;\n  3:     5,    10,      6,      1;\n  4:    15,    37,     31,     10,      1;\n  5:    52,   151,    160,     75,     15,     1;\n  6:   203,   674,    856,    520,    155,    21,    1;\n  7:   877,  3263,   4802,   3556,   1400,   287,   28,   1;\n  8:  4140, 17007,  28337,  24626,  11991,  3290,  490,  36,  1;\n  9: 21147, 94828, 175896, 174805, 101031, 34671, 6972, 786, 45, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (1+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[(1 + x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {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] = (1 + x)*v[i - 1] + (1 + x)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-6fea5aff4f44fa54","steps":["basis A049020"],"edges":["e-2ff0affdc4d5d50d"],"text":"A023531 \u2192 basis A049020"},"headline":"A049020: 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.","chain":"A023531 \u2192 basis A049020"}