{"id":"n-656386ac18ecd282","revision":1,"first_index":0,"fingerprint":"f6-dba5521c033289bc","name":"basis_map_A013611 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..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"],["9","48","48"],["225","1380","2160","960"],["11025","73920","144480","107520","26880"],["893025","6384420","14364000","13910400","6048000","967680"],["108056025","811807920","2018958480","2315174400","1343865600","383201280","42577920"],["18261468225","142814451780","383417994960","496250314560","347502355200","134642027520","27122135040","2214051840"],["4108830350625","33228939744000","94837915972800","134661400473600","107963048793600","51144597504000","14181002035200","2125489766400","132843110400"],["1187451971330625","9882564049858500","29667725618731200","45366123023020800","40358296333555200","22122275996620800","7576142218444800","1578574680883200","182924963020800","9033331507200"],["428670161650355625","3657851971820046000","11461123816151209200","18631917558334080000","18017170326163008000","11053372156130304000","4416280316601753600","1145652268400640000","186007587397632000","17163329863680000","686533194547200"],["189043541287806830625","1649121013151270158500","5361615168555567121200","9179410043782030852800","9510653188737949248000","6387979428251156736000","2876062880736318873600","876200196959229542400","178264136588009472000","23193665811283968000","1744480847344435200","57668788341964800"],["100004033341249813400625","889777021755500142264000","2988013557375811861696800","5349176508667806496281600","5875641260870321990649600","4254221210908753244160000","2109131371308619103846400","728107689219173764300800","174912146375306128588800","28669749780266090496000","3056647622883331276800","190999026988587417600","5305528527460761600"],["62502520838281133375390625","566111041931312570255062500","1956486175535432427786900000","3642036673654960246345680000","4207193438910731893784160000","3246452382905002976664960000","1743629228158762264320000000","665980442892845513072640000","182130860406483706798080000","35409808250196919418880000","4777379742328691097600000","425039154156200263680000","22415858028521717760000","530552852746076160000"],["45564337691106946230659765625","419445221818461226120482750000","1487418414493911997444196850000","2866345242052292721786985920000","3460383977720659257173986080000","2821040678540106214517445120000","1621722564681478012169095680000","673811699510030703576514560000","204699285068753937667645440000","45483883138293794590556160000","7306969123178883107389440000","825810555551368630763520000","62245389151661960724480000","2807685696732235038720000","57299708096576225280000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","105","4725","363825","42567525","7023641625","1552224799125","442384067750625","157931112186973125","69015896025707255625","36233345413496309203125","22500907501781208015140625","16313157938791375810976953125","13654113194768381553787709765625"],"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":[["1","-4"],["-4","8"],["4","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168273,"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-413dde327980a923"]},{"id":168274,"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-413dde327980a923"]},{"id":168275,"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-413dde327980a923"]}],"region_exact":{},"incoming_edges":[{"id":"e-413dde327980a923","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-656386ac18ecd282","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":"516e37a00af9e7255f51fcceb62ccf129c82fe1444ac72567d5687e3602bdad1","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-1336d058dca9979e","role":"sequence","name":"Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..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:                9,               48,                48;\n  3:              225,             1380,              2160,               960;\n  4:            11025,            73920,            144480,            107520,             26880;\n  5:           893025,          6384420,          14364000,          13910400,           6048000,            967680;\n  6:        108056025,        811807920,        2018958480,        2315174400,        1343865600,         383201280,         42577920;\n  7:      18261468225,     142814451780,      383417994960,      496250314560,      347502355200,      134642027520,      27122135040,       2214051840;\n  8:    4108830350625,   33228939744000,    94837915972800,   134661400473600,   107963048793600,    51144597504000,   14181002035200,    2125489766400,    132843110400;\n  9: 1187451971330625, 9882564049858500, 29667725618731200, 45366123023020800, 40358296333555200, 22122275996620800, 7576142218444800, 1578574680883200, 182924963020800, 9033331507200;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n^2-4*n+1+(8*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[(4*n^2 - 4*n + 1 + (8*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] = (4*n^2 - 4*n + 1 + (8*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-1336d058dca9979e","steps":["basis A013611"],"edges":["e-413dde327980a923"],"text":"A204420 \u2192 basis A013611"},"headline":"A204420 \u2192 basis A013611","chain":null}