{"id":"n-8431ed683c9ae995","revision":0,"first_index":0,"fingerprint":"f6-4a49296f0fcc9fdd","name":"shift_x_plus_one of basis_map_A013611 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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":true,"rows":[["1"],["6","4"],["66","92","32"],["1056","2264","1616","384"],["22176","64440","70160","33920","6144"],["576576","2118960","3112960","2285120","838144","122880"],["17873856","79525584","147356800","145549760","80825344","23924736","2949120"],["643458816","3363388992","7531561152","9365781760","6985105664","3124400128","776060928","82575360"],["26381811456","158489630784","416422454976","625007009024","586094348544","351623786496","131799302144","28219539456","2642411520"],["1213563326976","8240268228480","24861059637120","43741530794240","49460592357888","37274090726400","18721224212480","6042873692160","1137454350336","95126814720"],["61891729675776","468796212731520","1597524770632320","3225260455991040","4272151442021888","3879402321361920","2445746063892480","1057035526799360","299725119553536","50349641564160","3805072588800"],["3465936861843456","28975824018699264","110088420515596800","250905675443320320","381151940816831488","405221193445230592","307655481717903360","166806816312033280","63294169874169856","16007485187948544","2428468293795840","167423193907200"],["211422148572450816","1933890234509140992","8106233204348969472","20589490386791185920","35293740811106096128","43013785959366977536","38217601670163173376","24942678917493391360","11867671545301958656","4014576750425014272","916495854943076352","126779292930539520","8036313307545600"],["13953861805781753856","138630707203370747904","635573683681507316736","1780430492154364683264","3400040393646144012288","4674184395495737516032","4759078580117852274688","3633532095403048845312","2080285625699585622016","882080985883752792064","269246717448343781376","56025217790455578624","7122919910686064640","417888291992371200"],["990724188210504523776","10624196472563101317120","52889051144775781370880","162002691229124302248960","341106975509520647135232","522269354124381428326400","599648905336128812400640","524489179260216195399680","351178076767241314500608","179123745036923243069440","68513052148322564833280","19055606640229597839360","3643139509924222992384","428553583729877975040","23401744351572787200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","10","190","5320","196840","9054640","498005200","31872332800","2326680294400","190787784140800","17361688356812800","1736168835681280000","189242403089259520000","22330603564532623360000","2835986652695643166720000"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["5","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":190769,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-fcd100c6c720c56e"]},{"id":190770,"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-492297830ad3cf7a","e-fcd100c6c720c56e"]},{"id":190771,"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-492297830ad3cf7a","e-fcd100c6c720c56e"]},{"id":190772,"position":3,"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-492297830ad3cf7a","e-fcd100c6c720c56e"]},{"id":190773,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-492297830ad3cf7a"]}],"region_exact":{},"incoming_edges":[{"id":"e-492297830ad3cf7a","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-8431ed683c9ae995","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"7fa0637474c33adbde7c6a4a37c1ebc177f044a571258f2635b5617cdb1854ce","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-e63fe40b997d2bc1","role":"sequence","name":"basis_map_A013611 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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]"}]},{"id":"e-fcd100c6c720c56e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-8431ed683c9ae995","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":"2830551bfdf3ea5371b0fa6d6140bbc05124958914345c43180104501f4362fb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-e63fe40b997d2bc1","role":"sequence","name":"basis_map_A013611 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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":[],"used_by_total":0,"links":[],"oeis":[],"bfiles":[],"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,             4;\n  2:            66,            92,             32;\n  3:          1056,          2264,           1616,            384;\n  4:         22176,         64440,          70160,          33920,           6144;\n  5:        576576,       2118960,        3112960,        2285120,         838144,         122880;\n  6:      17873856,      79525584,      147356800,      145549760,       80825344,       23924736,        2949120;\n  7:     643458816,    3363388992,     7531561152,     9365781760,     6985105664,     3124400128,      776060928,      82575360;\n  8:   26381811456,  158489630784,   416422454976,   625007009024,   586094348544,   351623786496,   131799302144,   28219539456,    2642411520;\n  9: 1213563326976, 8240268228480, 24861059637120, 43741530794240, 49460592357888, 37274090726400, 18721224212480, 6042873692160, 1137454350336, 95126814720;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (5*n+1+4*n*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[(5*n + 1 + 4*n*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] = (5*n + 1 + 4*n*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}}],"derivation":{"root":"n-4d60c3dd8627c01d","steps":["basis A013611","basis A007318"],"edges":["e-60ae4909e1eb1035","e-492297830ad3cf7a"],"text":"A094638 \u2192 basis A013611 \u2192 basis A007318"},"headline":"A094638 \u2192 basis A013611 \u2192 basis A007318","chain":null}