{"id":"n-2a7a2754f632f0f9","revision":1,"first_index":0,"fingerprint":"f6-e3473847634e4d8f","name":"basis_map_A013611 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","4"],["2","12","16"],["18","116","192","64"],["504","3320","5840","2560","256"],["32760","217816","392880","189760","26880","1024"],["4127760","27575856","50374144","25481280","4145920","236544","4096"],["895723920","6000471792","11041492672","5730934336","1001589760","67913728","1835008","16384"],["308129028480","2067745192128","3822275366336","2015607382272","367470614784","27368681472","902897664","12976128","65536"],["158070191610240","1061985799675584","1969098243698880","1049295688570880","196574854913280","15510016054272","572661227520","10268344320","85524480","262144"],["115391239875475200","775881914529617280","1441689661098884736","773862245631537920","147696826840977920","12108611139271680","480082760306688","9786536263680","103506247680","533463040","1048576"],["115506631115350675200","777119361403648798080","1446234878418102089856","780402866521564996864","150939972650345049600","12711507057774863360","528997287624081408","11716653841170432","142755898982400","948021493760","3183476736","4194304"],["153854832645647099366400","1035585015914121601743360","1929493335498526578880512","1045281557720396984182272","204173655036345866054656","17535487291557498193920","755470415346375888896","17722572066935341056","237017472809238528","1833788225617920","8032476987392","18320719872","16777216"],["266015005644323834804505600","1791141911846098837811735040","3340236317140608941291378688","1815009786640560491966670336","357197375788723590345229312","31135552147248297841506304","1376350297300113904676864","33664208765116708241408","480693498754914779136","4118689733330337792","21223305613672448","63806432608256","102290685952","67108864"],["584700982406223788900303308800","3937993982260302540849411640320","7349003992722442848309697296384","4002752456304514397107906913280","792379871130176693546680709120","69864733122806653017011773440","3149760162054643553845772288","79499332054926980333322240","1191221145323769517506560","10975654028879741583360","63123584672173391872","225139761327636480","480060658155520","556668026880","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","30","390","12480","861120","111945600","24739977600","8609512204800","4451117809881600","3267120472453094400","3283456074815359872000","4386697315953320788992000","7602146448547104927323136000","16739926479700725049965545472000"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"],["3","0"],["-3","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168255,"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-8aecb1bbda67a980"]},{"id":168256,"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-8aecb1bbda67a980"]},{"id":168257,"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-8aecb1bbda67a980"]}],"region_exact":{},"incoming_edges":[{"id":"e-8aecb1bbda67a980","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-2a7a2754f632f0f9","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":"24bb56d209b847685d50b9b38a2c904c38755c51c4f38c8be0f82451494e3e5b","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,                4;\n  2:               2,               12,               16;\n  3:              18,              116,              192,               64;\n  4:             504,             3320,             5840,             2560,             256;\n  5:           32760,           217816,           392880,           189760,           26880,           1024;\n  6:         4127760,         27575856,         50374144,         25481280,         4145920,         236544,         4096;\n  7:       895723920,       6000471792,      11041492672,       5730934336,      1001589760,       67913728,      1835008,       16384;\n  8:    308129028480,    2067745192128,    3822275366336,    2015607382272,    367470614784,    27368681472,    902897664,    12976128,    65536;\n  9: 158070191610240, 1061985799675584, 1969098243698880, 1049295688570880, 196574854913280, 15510016054272, 572661227520, 10268344320, 85524480, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^3-3*n^2+3*n+4*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 + 4*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 + 4*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 A013611"],"edges":["e-8aecb1bbda67a980"],"text":"A269947 \u2192 basis A013611"},"headline":"A269947 \u2192 basis A013611","chain":null}