{"id":"n-1b5bd96740815d9f","revision":1,"first_index":0,"fingerprint":"f6-61c77c59a5bac5ac","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 = 6.","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"],["-7","1"],["56","-15","1"],["-504","191","-24","1"],["5040","-2414","431","-34","1"],["-55440","31594","-7155","805","-45","1"],["665280","-434568","117454","-16815","1345","-57","1"],["-8648640","6314664","-1961470","336049","-34300","2086","-70","1"],["121080960","-97053936","33775244","-6666156","816249","-63504","3066","-84","1"],["-1816214400","1576890000","-603682596","133767584","-18909891","1768809","-109494","4326","-99","1"],["29059430400","-27046454400","11235811536","-2743963940","436325840","-47210835","3520713","-178710","5910","-115","1"],["-494010316800","488849155200","-218055250512","57883198516","-10161503220","1238910035","-107062956","6558783","-279180","7865","-132","1"],["8892185702400","-9293295110400","4413843664416","-1259952823800","240790256476","-32461883850","3166043243","-225121050","11584023","-420750","10241","-150","1"],["-168951528345600","185464792800000","-93156324734304","28352947316616","-5834967696844","857566049626","-92616705467","7443343193","-445217487","19578273","-615329","13091","-169","1"],["3379030566912000","-3878247384345600","2048591287486080","-660215271066624","145052301253496","-22986288689364","2709900158966","-241483569327","16347692933","-836782947","31884853","-877149","16471","-189","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-6","42","-336","3024","-30240","332640","-3991680","51891840","-726485760","10897286400","-174356582400","2964061900800","-53353114214400","1013709170073600"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A051339","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-6","1"],["-1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160055,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[13/2, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"13/2"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [13/2, +inf)","region_exact":null,"edges":["e-297f51c747adaedd"]},{"id":160056,"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-297f51c747adaedd"]},{"id":160057,"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-297f51c747adaedd"]}],"region_exact":{},"incoming_edges":[{"id":"e-297f51c747adaedd","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"-2\",\"intercept\":\"13\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-1b5bd96740815d9f","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":"9813c310978769d8537dda87e72b1104da68a279543bb3eceff5ffd467fbc0e0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"13/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-e24e4dcabf4aa882","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-7c584a5ecee561a7","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 = 6."},{"id":"e-e24e4dcabf4aa882","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-7c584a5ecee561a7","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 = 6."}],"used_by_total":2,"links":[{"id":"l-98f4f9cc23f83a25","kind":"oeis_match","node_a_id":"n-1b5bd96740815d9f","node_b_id":null,"fingerprint":null,"oeis_id":"A051339","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":"A051339","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A051339","relation":"identification"},{"oeis_id":"A051339","relation":"match_triangle"}],"bfiles":[{"node_id":"n-1b5bd96740815d9f","oeis_id":"A051339","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":29864}],"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:          -7,          1;\n  2:          56,        -15,          1;\n  3:        -504,        191,        -24,         1;\n  4:        5040,      -2414,        431,       -34,         1;\n  5:      -55440,      31594,      -7155,       805,       -45,       1;\n  6:      665280,    -434568,     117454,    -16815,      1345,     -57,       1;\n  7:    -8648640,    6314664,   -1961470,    336049,    -34300,    2086,     -70,    1;\n  8:   121080960,  -97053936,   33775244,  -6666156,    816249,  -63504,    3066,  -84,   1;\n  9: -1816214400, 1576890000, -603682596, 133767584, -18909891, 1768809, -109494, 4326, -99, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+6-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 + 6 - 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 + 6 - 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":"A051339","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:          -7,          1;\n  2:          56,        -15,          1;\n  3:        -504,        191,        -24,         1;\n  4:        5040,      -2414,        431,       -34,         1;\n  5:      -55440,      31594,      -7155,       805,       -45,       1;\n  6:      665280,    -434568,     117454,    -16815,      1345,     -57,       1;\n  7:    -8648640,    6314664,   -1961470,    336049,    -34300,    2086,     -70,    1;\n  8:   121080960,  -97053936,   33775244,  -6666156,    816249,  -63504,    3066,  -84,   1;\n  9: -1816214400, 1576890000, -603682596, 133767584, -18909891, 1768809, -109494, 4326, -99, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n+6-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 + 6 - 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 + 6 - 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+13"],"edges":["e-297f51c747adaedd"],"text":"A028338 \u2192 x \u21a6 \u22122x+13"},"headline":"A051339: Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] Product_{m=1..n} (x - m - r), with r = 6.","chain":"A028338 \u2192 x \u21a6 \u22122x+13"}