{"id":"n-95a19db879d4e5b4","revision":1,"first_index":0,"fingerprint":"f6-c51624589f8d4a40","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 = 5.","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"],["-6","1"],["42","-13","1"],["-336","146","-21","1"],["3024","-1650","335","-30","1"],["-30240","19524","-5000","635","-40","1"],["332640","-245004","74524","-11985","1075","-51","1"],["-3991680","3272688","-1139292","218344","-24885","1687","-63","1"],["51891840","-46536624","18083484","-3977764","541849","-46816","2506","-76","1"],["-726485760","703404576","-299705400","73772180","-11563650","1197273","-81900","3570","-90","1"],["10897286400","-11277554400","5198985576","-1406288100","247226930","-29522745","2425773","-135450","4920","-105","1"],["-174356582400","191338156800","-94461323616","27699595176","-5361918980","719590850","-68335113","4592973","-214170","6600","-121","1"],["2964061900800","-3427105248000","1797180658272","-565354441608","118852217836","-17594963430","1881287771","-146415654","8233863","-326370","8657","-138","1"],["-53353114214400","64651956364800","-35776357096896","11973560607216","-2704694362656","435561559576","-51458143308","4516769543","-294625188","14108523","-482196","11141","-156","1"],["1013709170073600","-1281740285145600","744402741205824","-263274008634000","63362753497680","-10980363994600","1413266282428","-137276764625","10114648115","-562687125","23270247","-693875","14105","-175","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-5","30","-210","1680","-15120","151200","-1663200","19958400","-259459200","3632428800","-54486432000","871782912000","-14820309504000","266765571072000"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A051338","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-5","1"],["-1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160486,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[11/2, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"11/2"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [11/2, +inf)","region_exact":null,"edges":["e-2e6c2042efefd194"]},{"id":160487,"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-2e6c2042efefd194"]},{"id":160488,"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-2e6c2042efefd194"]}],"region_exact":{},"incoming_edges":[{"id":"e-2e6c2042efefd194","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"-2\",\"intercept\":\"11\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-95a19db879d4e5b4","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":"20e20faa0667084158041e3af52f5809aa97be36c282a2ca6b3c19c35d6333db","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"11/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-8a24318fab51e026","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-7983b931e158302b","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 = 5."},{"id":"e-8a24318fab51e026","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-7983b931e158302b","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 = 5."}],"used_by_total":2,"links":[{"id":"l-6ea2904bb51fadba","kind":"oeis_match","node_a_id":"n-95a19db879d4e5b4","node_b_id":null,"fingerprint":null,"oeis_id":"A051338","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":"A051338","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A051338","relation":"identification"},{"oeis_id":"A051338","relation":"match_triangle"}],"bfiles":[{"node_id":"n-95a19db879d4e5b4","oeis_id":"A051338","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":29536}],"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:         -6,         1;\n  2:         42,       -13,          1;\n  3:       -336,       146,        -21,        1;\n  4:       3024,     -1650,        335,      -30,         1;\n  5:     -30240,     19524,      -5000,      635,       -40,       1;\n  6:     332640,   -245004,      74524,   -11985,      1075,     -51,      1;\n  7:   -3991680,   3272688,   -1139292,   218344,    -24885,    1687,    -63,    1;\n  8:   51891840, -46536624,   18083484, -3977764,    541849,  -46816,   2506,  -76,   1;\n  9: -726485760, 703404576, -299705400, 73772180, -11563650, 1197273, -81900, 3570, -90, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+5-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 + 5 - 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 + 5 - 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":"A051338","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:         -6,         1;\n  2:         42,       -13,          1;\n  3:       -336,       146,        -21,        1;\n  4:       3024,     -1650,        335,      -30,         1;\n  5:     -30240,     19524,      -5000,      635,       -40,       1;\n  6:     332640,   -245004,      74524,   -11985,      1075,     -51,      1;\n  7:   -3991680,   3272688,   -1139292,   218344,    -24885,    1687,    -63,    1;\n  8:   51891840, -46536624,   18083484, -3977764,    541849,  -46816,   2506,  -76,   1;\n  9: -726485760, 703404576, -299705400, 73772180, -11563650, 1197273, -81900, 3570, -90, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+5-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 + 5 - 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 + 5 - 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+11"],"edges":["e-2e6c2042efefd194"],"text":"A028338 \u2192 x \u21a6 \u22122x+11"},"headline":"A051338: Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 5.","chain":"A028338 \u2192 x \u21a6 \u22122x+11"}