{"id":"n-677d34c7af372519","revision":1,"first_index":0,"fingerprint":"f6-a33ed99ce72b6651","name":"Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.","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","3","2"],["1","7","12","6"],["1","15","50","60","24"],["1","31","180","390","360","120"],["1","63","602","2100","3360","2520","720"],["1","127","1932","10206","25200","31920","20160","5040"],["1","255","6050","46620","166824","317520","332640","181440","40320"],["1","511","18660","204630","1020600","2739240","4233600","3780000","1814400","362880"],["1","1023","57002","874500","5921520","21538440","46070640","59875200","46569600","19958400","3628800"],["1","2047","173052","3669006","33105600","158838240","451725120","801496080","898128000","618710400","239500800","39916800"],["1","4095","523250","15195180","180204024","1118557440","4115105280","9574044480","14495120640","14270256000","8821612800","3113510400","479001600"],["1","8191","1577940","62350470","961800840","7612364760","35517081600","105398092800","207048441600","273158645760","239740300800","134399865600","43589145600","6227020800"],["1","16383","4750202","254135700","5058406080","50483192760","294293759760","1091804313600","2706620716800","4595022432000","5368729766400","4249941696000","2179457280000","653837184000","87178291200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","6","26","150","1082","9366","94586","1091670","14174522","204495126","3245265146","56183135190","1053716696762","21282685940886"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A028246","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":[["0","1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158369,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[-1, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0)","region_exact":null,"edges":["e-994b5c04cf13d0cc"]},{"id":158370,"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-994b5c04cf13d0cc"]},{"id":158371,"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-994b5c04cf13d0cc"]},{"id":158372,"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-994b5c04cf13d0cc"]},{"id":158373,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[0, 1]","output_interval":"[-1, 0]","statement":"source [0, 1], target [-1, 0]"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [0, 1] to roots in [-1, 0]: source [0, 1], target [-1, 0]","region_exact":null,"edges":["e-4720724f7f8010a1"]}],"region_exact":{},"incoming_edges":[{"id":"e-4720724f7f8010a1","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-677d34c7af372519","premise_count":0,"theorem":"interval basis maps: for L f = (a + b t) f + kappa (t - l)(t - h) f', l < h, kappa > 0, b + kappa deg g > 0, and g with positive leading coefficient, real-rooted in [l, h] with endpoint multiplicities m_l, m_h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in [l, h] if and only if S lies in [a + b l - kappa (h - l) m_l, a + b h + kappa (h - l) m_h] (RealRooted intervalBasisMap_maps_realRootedIn_iff; Ma and Wang, EJC 15 (2008) R17, Theorem 2 and Corollary 3); a negative leading coefficient of g only changes the sign of T","lean_route":null,"lean_declarations":[],"certificate_hash":"a2ca64371a271524183852f9e53dc239f35178b10ce2f32bc3a70089fffe4627","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"[0, 1]","output_interval":"[-1, 0]","statement":"source [0, 1], target [-1, 0]"}],"premises":[]},{"id":"e-994b5c04cf13d0cc","operation":{"operation":"theorem_check","theorem":"ma_wang_interval"},"operation_detail":"ma_wang_interval","conclusion_id":"n-677d34c7af372519","premise_count":0,"theorem":"S.-M. Ma and Y. Wang, q-Eulerian polynomials and polynomials with only real zeros, Electron. J. Combin. 15 (2008) R17, Theorem 2 and Corollary 3 (arXiv:math/0611826), in the closed two-endpoint form of the RealRooted library (https://github.com/PerAlexandersson/RealRooted, RealRooted.affineEndpointStep_closed), after the change of variable x = U + (U - L) y, with the endpoint multiplicities tracked exactly through the induction","lean_route":null,"lean_declarations":["RealRooted.affineEndpointStep_closed","RealRooted.affineEndpointStep_roots_mem_Icc_iff","RealRooted.affineEndpointStep_rootMultiplicity_zero","RealRooted.affineEndpointStep_rootMultiplicity_neg_one","RealRooted.MaWang.endpointStep","RealRooted.MaWang.affineEndpointSequence","RealRooted.normalizedAffineEndpointSequence_roots_mem_Icc_iff"],"certificate_hash":"3157405e36d8826a979eb0b185fa9c53e0952e788f8d571d6163588c944c7d9b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-766d0e8c11bad8cd","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-f797be9dcc9711d3","conclusion_name":"obreschkoff_combination of Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows."},{"id":"e-766d0e8c11bad8cd","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-f797be9dcc9711d3","conclusion_name":"obreschkoff_combination of Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows."},{"id":"e-222fddff0a5b4a86","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-45ec3349543b0d37","conclusion_name":"Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018."}],"used_by_total":3,"links":[{"id":"l-3e581bb02162afec","kind":"fingerprint_related","node_a_id":"n-677d34c7af372519","node_b_id":"n-5a739e9e90502f2d","fingerprint":"f6-a33ed99ce72b6651","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a33ed99ce72b6651"},"other_id":"n-5a739e9e90502f2d","other":{"id":"n-5a739e9e90502f2d","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.","first_index":1,"fingerprint":"f6-a33ed99ce72b6651","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","2"]],"card_rows":[["1"],["1"],["2","2"],["6","9","3"]],"row_sums_preview":["1","1","4","18","104","750","6492","65562"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-3ffff24fcb4f40a0","steps":["x \u21a6 x+1"],"edges":["e-5885e4696854d233"],"text":"A334218 \u2192 x \u21a6 x+1"},"headline":"A334218 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-507db9f78945562e","kind":"fingerprint_related","node_a_id":"n-677d34c7af372519","node_b_id":"n-45ec3349543b0d37","fingerprint":"f6-a33ed99ce72b6651","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a33ed99ce72b6651"},"other_id":"n-45ec3349543b0d37","other":{"id":"n-45ec3349543b0d37","name":"Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018.","first_index":0,"fingerprint":"f6-a33ed99ce72b6651","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["2","3","1"]],"card_rows":[["1"],["1","1"],["2","3","1"],["6","12","7","1"]],"row_sums_preview":["1","2","6","26","150","1082","9366","94586"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":["A130850"],"derivation":{"root":"n-677d34c7af372519","steps":["reverse"],"edges":["e-222fddff0a5b4a86"],"text":"A028246 \u2192 reverse"},"headline":"A130850: Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018.","chain":"A028246 \u2192 reverse"}},{"id":"l-08ce5dcb0722c722","kind":"oeis_match","node_a_id":"n-677d34c7af372519","node_b_id":null,"fingerprint":null,"oeis_id":"A130850","in_catalog":1,"target":"reversed_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":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A130850","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-bfb8f5272de132d1","kind":"oeis_match","node_a_id":"n-677d34c7af372519","node_b_id":null,"fingerprint":null,"oeis_id":"A076726","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A076726","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-c354c1db351a94b7","kind":"oeis_match","node_a_id":"n-677d34c7af372519","node_b_id":null,"fingerprint":null,"oeis_id":"A028246","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":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A028246","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-dbcf0fc98fafd3ab","kind":"oeis_match","node_a_id":"n-677d34c7af372519","node_b_id":null,"fingerprint":null,"oeis_id":"A000629","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":"A000629","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A028246","relation":"identification"},{"oeis_id":"A130850","relation":"match_reversed_triangle"},{"oeis_id":"A000629","relation":"match_row_sums"},{"oeis_id":"A076726","relation":"match_row_sums"},{"oeis_id":"A028246","relation":"match_triangle"}],"bfiles":[{"node_id":"n-677d34c7af372519","oeis_id":"A000629","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":37263},{"node_id":"n-677d34c7af372519","oeis_id":"A028246","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":34122},{"node_id":"n-677d34c7af372519","oeis_id":"A130850","target":"reversed_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":34120}],"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,   3,     2;\n  3: 1,   7,    12,      6;\n  4: 1,  15,    50,     60,      24;\n  5: 1,  31,   180,    390,     360,     120;\n  6: 1,  63,   602,   2100,    3360,    2520,     720;\n  7: 1, 127,  1932,  10206,   25200,   31920,   20160,    5040;\n  8: 1, 255,  6050,  46620,  166824,  317520,  332640,  181440,   40320;\n  9: 1, 511, 18660, 204630, 1020600, 2739240, 4233600, 3780000, 1814400, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (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 + x)*P[n - 1, x] + (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 + x)*v[i - 1] + (x + 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":"A028246","target":"triangle","first_row":0,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 1,   1;\n   3: 1,   3,     2;\n   4: 1,   7,    12,      6;\n   5: 1,  15,    50,     60,      24;\n   6: 1,  31,   180,    390,     360,     120;\n   7: 1,  63,   602,   2100,    3360,    2520,     720;\n   8: 1, 127,  1932,  10206,   25200,   31920,   20160,    5040;\n   9: 1, 255,  6050,  46620,  166824,  317520,  332640,  181440,   40320;\n  10: 1, 511, 18660, 204630, 1020600, 2739240, 4233600, 3780000, 1814400, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + (x+x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + (x + x^2)*D[P[n - 1, x], x]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + x)*v[i - 1] + (x + x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A130850","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"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:      6,      12,       7,       1;\n  4:     24,      60,      50,      15,       1;\n  5:    120,     360,     390,     180,      31,       1;\n  6:    720,    2520,    3360,    2100,     602,      63,      1;\n  7:   5040,   20160,   31920,   25200,   10206,    1932,    127,     1;\n  8:  40320,  181440,  332640,  317520,  166824,   46620,   6050,   255,   1;\n  9: 362880, 1814400, 3780000, 4233600, 2739240, 1020600, 204630, 18660, 511, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+x)*P(n-1,x) + (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 + x)*P[n - 1, x] + (x + x^2)*D[P[n - 1, x], x]];\nTable[Reverse[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] + (x + x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(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":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-677d34c7af372519","steps":[],"edges":[],"text":"A028246"},"headline":"A028246: Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.","chain":null}