{"id":"n-afff5b8d53e95899","revision":1,"first_index":0,"fingerprint":"f6-7a12baa115b5eeac","name":"basis_map_A013611 of Triangle read by rows, Stirling cycle numbers of order 2, 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)^2*T(n-1, k), for 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"],["10","68","128","64"],["100","720","1552","1152","256"],["1700","12640","29264","25792","8960","1024"],["44200","335440","811424","787648","336128","62464","4096"],["1635400","12588080","31364448","32388672","15587328","3655680","401408","16384"],["81770000","635945600","1618574720","1744891392","908921088","245133312","34693120","2424832","65536"],["5315050000","41663544000","107751139200","119892239360","66059436288","19569349632","3235586048","296386560","13959168","262144"],["435834100000","3437670808000","9002247590400","10262168184320","5896442733056","1868924414976","343595454464","37246042112","2330198016","77332480","1048576"],["44019244100000","348948088008000","922977689862400","1072487976977920","636589388775936","212347136844800","42178838560768","5136232071168","384334168064","17131372544","415236096","4194304"],["5370347780200000","42747743713376000","113999070515244800","134535443950755840","81953857338575872","28452708250169344","5995206851792896","795335666925568","67433696788480","3627364122624","119184293888","2172649472","16777216"],["778700428129000000","6219904229560320000","16700856199564000000","19963635654920576000","12421451089896524800","4453458125628858368","983115826510647296","139304499111378944","12959228702031872","795702584934400","31791179104256","791771348992","11123294208","67108864"],["132379072781930000000","1060498520737770400000","2864025170844121280000","3460621486134753920000","2191501227902091520000","806773685716492021760","184943523009325473792","27614228154977009664","2760286875790934016","187106354246975488","8587310787461120","261765845745664","5058045411328","55901683712","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","30","270","3780","79380","2381400","97637400","5272419600","363796952400","31286537906400","3285086480172000","413920896501672000","61674213578749128000","10731313162702348272000"],"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":[["2","4"],["-2","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168157,"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-424ddc300423e142"]},{"id":168158,"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-424ddc300423e142"]},{"id":168159,"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-424ddc300423e142"]}],"region_exact":{},"incoming_edges":[{"id":"e-424ddc300423e142","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-afff5b8d53e95899","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":"82eba2dcf7fa6dd52ad857d129e83a8a66be4b2eab99bf2974f6c610a5b4fd93","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-54284d24a094e2d3","role":"sequence","name":"Triangle read by rows, Stirling cycle numbers of order 2, 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)^2*T(n-1, k), for 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:         10,          68,          128,           64;\n  4:        100,         720,         1552,         1152,         256;\n  5:       1700,       12640,        29264,        25792,        8960,        1024;\n  6:      44200,      335440,       811424,       787648,      336128,       62464,       4096;\n  7:    1635400,    12588080,     31364448,     32388672,    15587328,     3655680,     401408,     16384;\n  8:   81770000,   635945600,   1618574720,   1744891392,   908921088,   245133312,   34693120,   2424832,    65536;\n  9: 5315050000, 41663544000, 107751139200, 119892239360, 66059436288, 19569349632, 3235586048, 296386560, 13959168, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^2-2*n+2+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^2 - 2*n + 2 + 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^2 - 2*n + 2 + 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-54284d24a094e2d3","steps":["basis A013611"],"edges":["e-424ddc300423e142"],"text":"A269944 \u2192 basis A013611"},"headline":"A269944 \u2192 basis A013611","chain":null}