{"id":"n-7048485c2110aad8","revision":1,"first_index":0,"fingerprint":"f6-8011fd309de4ffa8","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 = 9.","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"],["-10","1"],["110","-21","1"],["-1320","362","-33","1"],["17160","-6026","791","-46","1"],["-240240","101524","-17100","1435","-60","1"],["3603600","-1763100","358024","-38625","2335","-75","1"],["-57657600","31813200","-7491484","976024","-75985","3535","-91","1"],["980179200","-598482000","159168428","-24083892","2267769","-136080","5082","-108","1"],["-17643225600","11752855200","-3463513704","592678484","-64903734","4717209","-227556","7026","-126","1"],["335221286400","-240947474400","77559615576","-14724404900","1825849430","-154530705","9040773","-361050","9420","-145","1"],["-6704425728000","5154170774400","-1792139785920","372047713576","-51241393500","4916463530","-335346165","16261773","-549450","12320","-165","1"],["140792940288000","-114942011990400","42789106278720","-9605141771016","1448116977076","-154487127630","11958732995","-676843398","27800223","-808170","15785","-186","1"],["-3097444686336000","2669517204076800","-1056302350122240","254102225241072","-41463715266688","4846833784936","-417579253520","26849287751","-1288448304","45579963","-1155440","19877","-208","1"],["71241227785728000","-64496340380102400","26964471256888320","-6900653530666896","1207767676374896","-152940892320216","14451156615896","-1035112871793","56483598743","-2336787453","72155083","-1612611","24661","-231","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-9","90","-990","11880","-154440","2162160","-32432400","518918400","-8821612800","158789030400","-3016991577600","60339831552000","-1267136462592000","27877002177024000"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A051523","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-9","1"],["-1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160064,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[19/2, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"19/2"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [19/2, +inf)","region_exact":null,"edges":["e-85dd368cbda0ff5a"]},{"id":160065,"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-85dd368cbda0ff5a"]},{"id":160066,"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-85dd368cbda0ff5a"]}],"region_exact":{},"incoming_edges":[{"id":"e-85dd368cbda0ff5a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"-2\",\"intercept\":\"19\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-7048485c2110aad8","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":"63c326fe3823c92c01e988f869766fb5cdb891440e4fb04e92f0c95e291b449e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"19/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-9a862b15d72a4b43","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-e29f027434b1791d","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 = 9."},{"id":"e-9a862b15d72a4b43","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-e29f027434b1791d","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 = 9."}],"used_by_total":2,"links":[{"id":"l-8b3925a95fdba912","kind":"oeis_match","node_a_id":"n-7048485c2110aad8","node_b_id":null,"fingerprint":null,"oeis_id":"A051523","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":"A051523","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A051523","relation":"identification"},{"oeis_id":"A051523","relation":"match_triangle"}],"bfiles":[{"node_id":"n-7048485c2110aad8","oeis_id":"A051523","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":30754}],"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:          -10,           1;\n  2:          110,         -21,           1;\n  3:        -1320,         362,         -33,         1;\n  4:        17160,       -6026,         791,       -46,         1;\n  5:      -240240,      101524,      -17100,      1435,       -60,       1;\n  6:      3603600,    -1763100,      358024,    -38625,      2335,     -75,       1;\n  7:    -57657600,    31813200,    -7491484,    976024,    -75985,    3535,     -91,    1;\n  8:    980179200,  -598482000,   159168428, -24083892,   2267769, -136080,    5082, -108,    1;\n  9: -17643225600, 11752855200, -3463513704, 592678484, -64903734, 4717209, -227556, 7026, -126, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+9-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 + 9 - 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 + 9 - 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":"A051523","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:          -10,           1;\n  2:          110,         -21,           1;\n  3:        -1320,         362,         -33,         1;\n  4:        17160,       -6026,         791,       -46,         1;\n  5:      -240240,      101524,      -17100,      1435,       -60,       1;\n  6:      3603600,    -1763100,      358024,    -38625,      2335,     -75,       1;\n  7:    -57657600,    31813200,    -7491484,    976024,    -75985,    3535,     -91,    1;\n  8:    980179200,  -598482000,   159168428, -24083892,   2267769, -136080,    5082, -108,    1;\n  9: -17643225600, 11752855200, -3463513704, 592678484, -64903734, 4717209, -227556, 7026, -126, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+9-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 + 9 - 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 + 9 - 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+19"],"edges":["e-85dd368cbda0ff5a"],"text":"A028338 \u2192 x \u21a6 \u22122x+19"},"headline":"A051523: Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 9.","chain":"A028338 \u2192 x \u21a6 \u22122x+19"}