{"id":"n-4b139b7d2e9e5f2c","revision":0,"first_index":0,"fingerprint":"f6-b27c99a765cfdef3","name":"basis_map_A013611 of basis_map_A007318 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"],["2","4"],["6","20","16"],["36","144","176","64"],["396","1728","2512","1408","256"],["7128","32688","52128","35392","10240","1024"],["192456","911088","1538208","1164096","418048","68608","4096"],["7313328","35391168","62096256","50388480","20542208","4279296","430080","16384"],["372979728","1834202880","3308473728","2818197504","1249206528","300412928","39051264","2555904","65536"],["24616662048","122549308992","225696077568","199234930176","93720420864","24824079360","3779035136","324894720","14548992","262144"],["2043182949984","10270059294528","19222971674112","17439283514880","8575734652416","2435280270336","412956233728","42082402304","2507145216","79953920","1048576"],["208404660898368","1055718779841792","2001823347937536","1855698805214208","944482068605952","282701526183936","51862656921600","5944229969920","424058421248","18183880704","426770432","4194304"],["25633773290499264","130687028564133888","250447146915684096","236258246433097728","123594089659388928","38550215995047936","7509912906092544","938590913986560","75936105693184","3932851011584","125228285952","2222981120","16777216"],["3742530900412892544","19182841263525544704","37088031563946413568","35495492566895004672","18989770076003174400","6122707893914554368","1250648148269703168","167073925066407936","14841035087151104","877940670464000","34014733795328","825468387328","11341398016","67108864"],["639972783970604625024","3295235979664519714560","6418784762488938898944","6218081355194831453184","3389232653264122841088","1122942130163401494528","238351664929777459200","33572233779434569728","3206112700168470528","209491994997948416","9328282160857088","277214029414400","5241252610048","56841207808","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","42","420","6300","138600","4296600","180457200","9925146000","694760220000","60444139140000","6407078748840000","813699001102680000","122054850165402000000","21359598778945350000000"],"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":[["3","4"],["-2","0"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":206192,"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-5a3f32e19af2481b"]},{"id":206193,"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-5a3f32e19af2481b"]},{"id":206194,"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-5a3f32e19af2481b"]},{"id":206195,"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-5a3f32e19af2481b"]}],"region_exact":{},"incoming_edges":[{"id":"e-5a3f32e19af2481b","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-4b139b7d2e9e5f2c","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":"115971858e48ac3f37e2bb5a3a89416d787cd07bbc2f8f137ee30fc88ec58433","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-c5818ec04781ce60","role":"sequence","name":"basis_map_A007318 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.","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:           2,            4;\n  2:           6,           20,           16;\n  3:          36,          144,          176,           64;\n  4:         396,         1728,         2512,         1408,         256;\n  5:        7128,        32688,        52128,        35392,       10240,        1024;\n  6:      192456,       911088,      1538208,      1164096,      418048,       68608,       4096;\n  7:     7313328,     35391168,     62096256,     50388480,    20542208,     4279296,     430080,     16384;\n  8:   372979728,   1834202880,   3308473728,   2818197504,  1249206528,   300412928,   39051264,   2555904,    65536;\n  9: 24616662048, 122549308992, 225696077568, 199234930176, 93720420864, 24824079360, 3779035136, 324894720, 14548992, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^2-2*n+3+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 + 3 + 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 + 3 + 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":["x \u21a6 x+1","basis A013611"],"edges":["e-0cfc062841fe3ed0","e-5a3f32e19af2481b"],"text":"A269944 \u2192 x \u21a6 x+1 \u2192 basis A013611"},"headline":"A269944 \u2192 x \u21a6 x+1 \u2192 basis A013611","chain":null}
