{"id":"n-47fe395e9f7d5f86","revision":1,"first_index":0,"fingerprint":"f6-f3c222c4860e5244","name":"T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.","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"],["1","4","2"],["1","9","18","6"],["1","16","72","96","24"],["1","25","200","600","600","120"],["1","36","450","2400","5400","4320","720"],["1","49","882","7350","29400","52920","35280","5040"],["1","64","1568","18816","117600","376320","564480","322560","40320"],["1","81","2592","42336","381024","1905120","5080320","6531840","3265920","362880"],["1","100","4050","86400","1058400","7620480","31752000","72576000","81648000","36288000","3628800"],["1","121","6050","163350","2613600","25613280","153679680","548856000","1097712000","1097712000","439084800","39916800"],["1","144","8712","290400","5880600","75271680","614718720","3161410560","9879408000","17563392000","15807052800","5748019200","479001600"],["1","169","12168","490776","12269400","198764280","2120152320","14841066240","66784798080","185513328000","296821324800","242853811200","80951270400","6227020800"],["1","196","16562","794976","24048024","480960480","6492966480","59364264960","363606122880","1454424491520","3636061228800","5288816332800","3966612249600","1220496076800","87178291200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","7","34","209","1546","13327","130922","1441729","17572114","234662231","3405357682","53334454417","896324308634","16083557845279"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A144084","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","-1"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159344,"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":false,"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-c98efb5092e3dc49"]},{"id":159345,"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-c98efb5092e3dc49"]},{"id":159346,"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-c98efb5092e3dc49"]},{"id":159347,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-c98efb5092e3dc49"]}],"region_exact":{},"incoming_edges":[{"id":"e-c98efb5092e3dc49","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-47fe395e9f7d5f86","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"9bdc3e17255514f18037338a007600b7db493f3902d6fef1feba9e25c9cb40a3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-50ecd620d262c41e","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-094e4df3b51dddea","conclusion_name":"obreschkoff_combination of T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set."},{"id":"e-50ecd620d262c41e","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-094e4df3b51dddea","conclusion_name":"obreschkoff_combination of T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set."},{"id":"e-e31dcd4b09a7ff12","operation":"preserver_image","operation_detail":"affine, shift -1","conclusion_id":"n-3de13f8c869a1c34","conclusion_name":"Triangle of coefficients of Laguerre polynomials L_n(x) (powers of x in decreasing order)."}],"used_by_total":3,"links":[{"id":"l-2a847b5fcca28304","kind":"fingerprint_related","node_a_id":"n-47fe395e9f7d5f86","node_b_id":"n-2ee8dc15b8ca5b2d","fingerprint":"f6-f3c222c4860e5244","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f3c222c4860e5244"},"other_id":"n-2ee8dc15b8ca5b2d","other":{"id":"n-2ee8dc15b8ca5b2d","name":"Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).","first_index":1,"fingerprint":"f6-f3c222c4860e5244","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["4","16","8"],["8","72","144","48"],["16","256","1152","1536","384"]],"card_rows":[["4","16","8"],["8","72","144","48"],["16","256","1152","1536","384"],["32","800","6400","19200","19200","3840"]],"row_sums_preview":["28","272","3344","49472","852928","16758016","369082624","8996922368"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2ee8dc15b8ca5b2d","steps":[],"edges":[],"text":"A395972"},"headline":"Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).","chain":null}},{"id":"l-f06286e0f1cafaf1","kind":"fingerprint_related","node_a_id":"n-47fe395e9f7d5f86","node_b_id":"n-8ab17db79dad1880","fingerprint":"f6-f3c222c4860e5244","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f3c222c4860e5244"},"other_id":"n-8ab17db79dad1880","other":{"id":"n-8ab17db79dad1880","name":"basis_map_A008277 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-f3c222c4860e5244","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["2","4","1"]],"card_rows":[["1"],["1","1"],["2","4","1"],["6","18","9","1"]],"row_sums_preview":["1","2","7","34","209","1546","13327","130922"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["basis A008277"],"edges":["e-07cfebc08bea7e3c"],"text":"A132393 \u2192 basis A008277"},"headline":"A132393 \u2192 basis A008277","chain":null}},{"id":"l-c5865308744f4ef1","kind":"oeis_match","node_a_id":"n-47fe395e9f7d5f86","node_b_id":null,"fingerprint":null,"oeis_id":"A002720","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":"A002720","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-dded9de90c4bff58","kind":"oeis_match","node_a_id":"n-47fe395e9f7d5f86","node_b_id":null,"fingerprint":null,"oeis_id":"A144084","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A144084","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A144084","relation":"identification"},{"oeis_id":"A002720","relation":"match_row_sums"},{"oeis_id":"A144084","relation":"match_triangle"}],"bfiles":[{"node_id":"n-47fe395e9f7d5f86","oeis_id":"A002720","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":35458},{"node_id":"n-47fe395e9f7d5f86","oeis_id":"A144084","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":28831}],"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: 1,  4,    2;\n  3: 1,  9,   18,     6;\n  4: 1, 16,   72,    96,     24;\n  5: 1, 25,  200,   600,    600,     120;\n  6: 1, 36,  450,  2400,   5400,    4320,     720;\n  7: 1, 49,  882,  7350,  29400,   52920,   35280,    5040;\n  8: 1, 64, 1568, 18816, 117600,  376320,  564480,  322560,   40320;\n  9: 1, 81, 2592, 42336, 381024, 1905120, 5080320, 6531840, 3265920, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-1)*x)*P(n-1,x) - x^2*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 + (2*n - 1)*x)*P[n - 1, x] - x^2*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 + (2*n - 1)*x)*v[i - 1] - x^2*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":"A144084","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: 1,  4,    2;\n  3: 1,  9,   18,     6;\n  4: 1, 16,   72,    96,     24;\n  5: 1, 25,  200,   600,    600,     120;\n  6: 1, 36,  450,  2400,   5400,    4320,     720;\n  7: 1, 49,  882,  7350,  29400,   52920,   35280,    5040;\n  8: 1, 64, 1568, 18816, 117600,  376320,  564480,  322560,   40320;\n  9: 1, 81, 2592, 42336, 381024, 1905120, 5080320, 6531840, 3265920, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-1)*x)*P(n-1,x) - x^2*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 + (2*n - 1)*x)*P[n - 1, x] - x^2*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 + (2*n - 1)*x)*v[i - 1] - x^2*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-47fe395e9f7d5f86","steps":[],"edges":[],"text":"A144084"},"headline":"A144084: T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.","chain":null}