{"id":"n-238e6ef5447963d1","revision":1,"first_index":0,"fingerprint":"f6-3f21007bdec2bcda","name":"Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 4.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":true,"rows":[["1"],["-5","1"],["30","-11","1"],["-210","107","-18","1"],["1680","-1066","251","-26","1"],["-15120","11274","-3325","485","-35","1"],["151200","-127860","44524","-8175","835","-45","1"],["-1663200","1557660","-617624","134449","-17360","1330","-56","1"],["19958400","-20355120","8969148","-2231012","342769","-33320","2002","-68","1"],["-259459200","284574960","-136954044","37972304","-6687009","775929","-59346","2886","-81","1"],["3632428800","-4243508640","2201931576","-668566300","131590430","-17550015","1606773","-99750","4020","-95","1"],["-54486432000","67285058400","-37272482280","12230426076","-2642422750","394840655","-41651610","3103023","-160050","5445","-110","1"],["871782912000","-1131047366400","663644774880","-232959299496","54509190076","-8959873230","1061266415","-91299978","5663823","-247170","7205","-126","1"],["-14820309504000","20099588140800","-12413008539360","4623952866312","-1159615530788","206827034986","-27001402285","2613366041","-187584969","9865713","-369655","9347","-143","1"],["266765571072000","-376612896038400","243533741849280","-95644160132976","25497032420496","-4882502160536","692852276116","-74041991023","5989895483","-365167803","16519503","-537901","11921","-161","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-4","20","-120","840","-6720","60480","-604800","6652800","-79833600","1037836800","-14529715200","217945728000","-3487131648000","59281238016000"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A049460","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-4","1"],["-1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160049,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[9/2, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"9/2"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [9/2, +inf)","region_exact":null,"edges":["e-6b900047034f4def"]},{"id":160050,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":true,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n(-x) have one sign","region_exact":null,"edges":["e-6b900047034f4def"]},{"id":160051,"position":2,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-6b900047034f4def"]}],"region_exact":{},"incoming_edges":[{"id":"e-6b900047034f4def","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"-2\",\"intercept\":\"9\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-238e6ef5447963d1","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":"af6fb100af99e834a742efb3e51d3952a8285fa635b98b848a101793b53d00e4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"9/2"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-4f6e747b794bcc2e","role":"sequence","name":"Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.","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-6d01d329dd41619f","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-07b4c74f1e84d85d","conclusion_name":"obreschkoff_combination of Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 4."},{"id":"e-6d01d329dd41619f","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-07b4c74f1e84d85d","conclusion_name":"obreschkoff_combination of Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 4."}],"used_by_total":2,"links":[{"id":"l-8627c1eb9a562fe6","kind":"oeis_match","node_a_id":"n-238e6ef5447963d1","node_b_id":null,"fingerprint":null,"oeis_id":"A049460","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":0,"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":"A049460","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A049460","relation":"identification"},{"oeis_id":"A049460","relation":"match_triangle"}],"bfiles":[{"node_id":"n-238e6ef5447963d1","oeis_id":"A049460","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":29175}],"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:         -5,         1;\n  2:         30,       -11,          1;\n  3:       -210,       107,        -18,        1;\n  4:       1680,     -1066,        251,      -26,        1;\n  5:     -15120,     11274,      -3325,      485,      -35,      1;\n  6:     151200,   -127860,      44524,    -8175,      835,    -45,      1;\n  7:   -1663200,   1557660,    -617624,   134449,   -17360,   1330,    -56,    1;\n  8:   19958400, -20355120,    8969148, -2231012,   342769, -33320,   2002,  -68,   1;\n  9: -259459200, 284574960, -136954044, 37972304, -6687009, 775929, -59346, 2886, -81, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+4-x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[-(n + 4 - x)*P[n - 1, 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] = -(n + 4 - x)*v[i - 1]); 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":"A049460","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:         -5,         1;\n  2:         30,       -11,          1;\n  3:       -210,       107,        -18,        1;\n  4:       1680,     -1066,        251,      -26,        1;\n  5:     -15120,     11274,      -3325,      485,      -35,      1;\n  6:     151200,   -127860,      44524,    -8175,      835,    -45,      1;\n  7:   -1663200,   1557660,    -617624,   134449,   -17360,   1330,    -56,    1;\n  8:   19958400, -20355120,    8969148, -2231012,   342769, -33320,   2002,  -68,   1;\n  9: -259459200, 284574960, -136954044, 37972304, -6687009, 775929, -59346, 2886, -81, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+4-x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[-(n + 4 - x)*P[n - 1, 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] = -(n + 4 - x)*v[i - 1]); 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-4f6e747b794bcc2e","steps":["x \u21a6 \u22122x+9"],"edges":["e-6b900047034f4def"],"text":"A028338 \u2192 x \u21a6 \u22122x+9"},"headline":"A049460: Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 4.","chain":"A028338 \u2192 x \u21a6 \u22122x+9"}