{"id":"n-c2c5d2e7e07878ae","revision":1,"first_index":0,"fingerprint":"f6-487c30882cf44b69","name":"basis_map_A013610 of Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)^3*T(n-1,k), for n>=0 and 0<=k<=n.","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"],["1","3"],["2","9","9"],["18","87","108","27"],["504","2490","3285","1080","81"],["32760","163362","220995","80055","8505","243"],["4127760","20681892","28335456","10749915","1311795","56133","729"],["895723920","4500353844","6210839628","2417737923","316909260","16116246","326592","2187"],["308129028480","1550808894096","2150029893564","850334364396","116269999209","6494716404","160696386","1732104","6561"],["158070191610240","796489349756688","1107617762080620","442671618615840","62197512687405","3680599512879","101921395230","1370658510","8562105","19683"],["115391239875475200","581911435897212960","810950434368122664","326473134875805060","46732199117653170","2873430182463885","85444417056537","1306344897990","10362312180","40054905","59049"],["115506631115350675200","582839521052736598560","813507119110182425544","329232459313785233052","47758350721398238350","3016500209999308395","94150152020985192","1563984494057601","14291709186150","71181896445","179272764","177147"],["153854832645647099366400","776688761935591201307520","1085340001217921200620288","440978157163292477701896","64601820538843809181356","4161253331883273497190","134457503121950200929","2365677802147680108","23728510118124603","137689413623190","452337010983","773778096","531441"],["266015005644323834804505600","1343356433884574128358801280","1878882928391592529476400512","765707253738986457548439048","113019482183150823507670212","7388612472442711304185578","244960782893501717897811","4493629429279189509519","48123627400680478911","309250526508869319","1195158932859177","2694873360933","3240195777","1594323"],["584700982406223788900303308800","2953495486695226905637058730240","4133814745906374102174204729216","1688661192503467011279898229040","250713943599782469442504443120","16579228660978531917122911080","560589638217244909851945312","10611879834236163695616195","119256621314533261174935","824103539468536199895","3554710913951079003","9508808445908265","15206570400645","13224909285","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","20","240","7440","505920","65263680","14358009600","4982229331200","2570830334899200","1884418635481113600","1891956310023038054400","2525761673880755802624000","4374619219161469050144768000","9628536901374393379368634368000"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","3"],["3","0"],["-3","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167567,"position":0,"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-f13e01bf2e1e97ea"]},{"id":167568,"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-f13e01bf2e1e97ea"]},{"id":167569,"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-f13e01bf2e1e97ea"]}],"region_exact":{},"incoming_edges":[{"id":"e-f13e01bf2e1e97ea","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-c2c5d2e7e07878ae","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":"e2076f70ea0761a163f33d9e623c0eca8998872937294c7e5a57d7d7832bb0ba","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-fefc87d068bda822","role":"sequence","name":"Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)^3*T(n-1,k), for n>=0 and 0<=k<=n.","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:               1,               3;\n  2:               2,               9,                9;\n  3:              18,              87,              108,              27;\n  4:             504,            2490,             3285,            1080,             81;\n  5:           32760,          163362,           220995,           80055,           8505,           243;\n  6:         4127760,        20681892,         28335456,        10749915,        1311795,         56133,          729;\n  7:       895723920,      4500353844,       6210839628,      2417737923,      316909260,      16116246,       326592,       2187;\n  8:    308129028480,   1550808894096,    2150029893564,    850334364396,   116269999209,    6494716404,    160696386,    1732104,    6561;\n  9: 158070191610240, 796489349756688, 1107617762080620, 442671618615840, 62197512687405, 3680599512879, 101921395230, 1370658510, 8562105, 19683;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^3-3*n^2+3*n+3*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^3 - 3*n^2 + 3*n + 3*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^3 - 3*n^2 + 3*n + 3*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-fefc87d068bda822","steps":["basis A013610"],"edges":["e-f13e01bf2e1e97ea"],"text":"A269947 \u2192 basis A013610"},"headline":"A269947 \u2192 basis A013610","chain":null}