{"id":"n-3933c6a9486f6595","revision":1,"first_index":0,"fingerprint":"f6-5353ce1fe8f9a53e","name":"basis_map_A008277 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":false,"rows":[["1"],["1","1"],["2","4","1"],["18","42","15","1"],["504","1236","492","46","1"],["32760","82080","34200","3620","115","1"],["4127760","10456920","4459680","501180","18570","246","1"],["895723920","2283736320","987126840","114719280","4605150","73182","469","1"],["308129028480","788784754320","343829622960","40794717000","1717311480","30145668","237332","820","1"],["158070191610240","405743492748960","177861040578720","21393903594960","928644752160","17332767504","153320976","663732","1341","1"],["115391239875475200","296756563391100000","130600025196372000","15859592375684400","703019151680400","13668228867600","130177005840","642491460","1653390","2080","1"],["115506631115350675200","297465467757757675200","131288581835352216000","16053630770383509600","722393839814486400","14453257392486000","144756473748480","777808397520","2310761970","3754190","3091","1"],["153854832645647099366400","396636975152206331716800","175436433636117613819200","21562885660297337532000","981171800762537340000","20046398973568268400","208137419267952240","1186241918027760","3874229437320","7345130760","7902312","4434","1"],["266015005644323834804505600","686335821845962600969430400","304077103599271795852752000","37522354397271106219243200","1721933616381774547752000","35741627620929914745600","381164821403465404800","2267453388964143600","7915778450652600","16640066698200","21087251328","15617472","6175","1"],["584700982406223788900303308800","1509518487244916083366581955200","669655963740243913477023830400","82890779131992976584407035200","3829220177669938660369147200","80460739265290376732308800","875828893994167666924800","5380899544069402042800","19729660651103779200","44640405653580000","63200717630424","55586246976","29264222","8386","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","7","76","2279","152776","19564357","4285985162","1483285818061","764014760038594","559324239040332371","561051304112647713652","748492554621547256497627","1295708344171039274358202976","2850676774669879893915577062409"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"],["3","0"],["-3","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":166160,"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-0bd629cc7b768a78"]},{"id":166161,"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-0bd629cc7b768a78"]},{"id":166162,"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-0bd629cc7b768a78"]}],"region_exact":{},"incoming_edges":[{"id":"e-0bd629cc7b768a78","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-3933c6a9486f6595","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"0a06103209b4eca819428c1355b42c92ae50d6036b2aebdbdea091f507318201","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,               1;\n  2:               2,               4,               1;\n  3:              18,              42,              15,              1;\n  4:             504,            1236,             492,             46,            1;\n  5:           32760,           82080,           34200,           3620,          115,           1;\n  6:         4127760,        10456920,         4459680,         501180,        18570,         246,         1;\n  7:       895723920,      2283736320,       987126840,      114719280,      4605150,       73182,       469,      1;\n  8:    308129028480,    788784754320,    343829622960,    40794717000,   1717311480,    30145668,    237332,    820,    1;\n  9: 158070191610240, 405743492748960, 177861040578720, 21393903594960, 928644752160, 17332767504, 153320976, 663732, 1341, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^3-3*n^2+3*n+x)*P(n-1,x) + x*d/dx 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 + x)*P[n - 1, x] + x*D[P[n - 1, x], 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 + x)*v[i - 1] + x*deriv(v[i - 1], x)); 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 A008277"],"edges":["e-0bd629cc7b768a78"],"text":"A269947 \u2192 basis A008277"},"headline":"A269947 \u2192 basis A008277","chain":null}