{"id":"n-2e619f362341fd8a","revision":0,"first_index":0,"fingerprint":"f6-045f1532ff1709f8","name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["2","4"],["6","20"],["24","104","48"],["120","616","560"],["720","4176","5440","960"],["5040","32112","52864","20160"],["40320","277056","539840","313600","26880"],["362880","2654784","5886144","4514048","887040"],["3628800","27999360","68835456","64574720","20160000","967680"],["39916800","322508160","863381376","945767680","402321920","46126080"],["479001600","4029765120","11592548352","14377972224","7669150720","1440552960","42577920"],["6227020800","54302952960","166183520256","228355944960","145095808000","38038640640","2767564800"],["87178291200","785149424640","2536117069824","3799795743744","2778995867648","931336806400","113654661120","2214051840"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","6","26","176","1296","11296","110176","1197696","14304896","186166016","2620022016","39631568896","640971452416","11034441916416"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-4"],["0","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":205036,"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-d0109470cd42a298"]},{"id":205037,"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-d0109470cd42a298"]},{"id":205038,"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-d0109470cd42a298"]},{"id":205039,"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-d0109470cd42a298"]}],"region_exact":{},"incoming_edges":[{"id":"e-d0109470cd42a298","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-2e619f362341fd8a","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":"a8c81578b2a29624ccd5c2cc5e6f90e5f84aad585db57b07b2c253741ed7e56d","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-497753d6192915db","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).","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;\n  2:      2,       4;\n  3:      6,      20;\n  4:     24,     104,      48;\n  5:    120,     616,     560;\n  6:    720,    4176,    5440,     960;\n  7:   5040,   32112,   52864,   20160;\n  8:  40320,  277056,  539840,  313600,  26880;\n  9: 362880, 2654784, 5886144, 4514048, 887040;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n-4)*x*P(n-2,x) + n*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(4*n - 4)*x*P[n - 2, x] + n*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; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (4*n - 4)*x*v[i - 2] + n*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-497753d6192915db","steps":["basis A013611"],"edges":["e-d0109470cd42a298"],"text":"A136394 \u2192 basis A013611"},"headline":"A136394 \u2192 basis A013611","chain":null}