{"id":"n-1336d058dca9979e","revision":1,"first_index":0,"fingerprint":"f6-181e40cb14f29d52","name":"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"],["0","1"],["0","6","3"],["0","120","90","15"],["0","5040","4620","1260","105"],["0","362880","378000","132300","18900","945"],["0","39916800","45571680","18711000","3534300","311850","10395"],["0","6227020800","7628100480","3511347840","794593800","94594500","5675670","135135"],["0","1307674368000","1695306412800","851804553600","219534915600","31783752000","2610808200","113513400","2027025"],["0","355687428096000","483353808537600","260511047596800","74194174454400","12377274109200","1250463614400","75259384200","2481078600","34459425"],["0","121645100408832000","172065063653683200","98278500640320000","30324117567744000","5642717059980000","662826764199600","49497518070000","2278457181000","58925616750","654729075"],["0","51090942171709440000","74821873843132416000","44890336605661747200","14799977891899200000","3006747634114224000","396884299223412000","34708319637591600","1996399895490000","72596359836000","1512424163250","13749310575"],["0","25852016738884976640000","39034959834574319616000","24435413420856889651200","8521266555231215385600","1861813794375478944000","269978650991673624000","26690748618759825600","1808469698782546800","82650955673286000","2435002902832500","41742906905700","316234143225"],["0","15511210043330985984000000","24067276319216716185600000","15637122048378491781120000","5723645268660151472640000","1330119940506067751040000","208532535454391148000000","22763915446047735960000","1752350534738523720000","94802315873535270000","3527275633531650000","85920816714232500","1233313158577500","7905853580625"],["0","10888869450418352160768000000","17314030647260071383859200000","11627076138580552567357440000","4440201273905645611883520000","1088282620489083650991360000","182303078282646415174080000","21610647100394071639920000","1844775792429732522360000","113864690181161899980000","5035810023324670590000","155552855438745765000","3185647888605682500","38849364495191250","213458046676875"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","1","9","225","11025","893025","108056025","18261468225","4108830350625","1187451971330625","428670161650355625","189043541287806830625","100004033341249813400625","62502520838281133375390625","45564337691106946230659765625"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A204420","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","-1"],["-6","2"],["4","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159580,"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-8239b1c6b4764045"]},{"id":159581,"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-8239b1c6b4764045"]},{"id":159582,"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-8239b1c6b4764045"]}],"region_exact":{},"incoming_edges":[{"id":"e-8239b1c6b4764045","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-1336d058dca9979e","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"75ac45a5ece707a69127081905aac1ec98084fc5c21cdd763f1373cfe6557418","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-2613ba1fbc2604f1","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-22e887254e1ffff8","conclusion_name":"basis_map_A013609 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n."},{"id":"e-413dde327980a923","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-656386ac18ecd282","conclusion_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."},{"id":"e-86d697d3c8220248","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-ed5fd6fb94c974b5","conclusion_name":"basis_map_A008277 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n."},{"id":"e-afc618911e5721d2","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-77311ba2b23da2eb","conclusion_name":"basis_map_A013610 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n."},{"id":"e-d4ca0207416a9ca5","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-2da216d37409bd5d","conclusion_name":"basis_map_A007318 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n."}],"used_by_total":5,"links":[{"id":"l-26da4668e8c2e4e7","kind":"fingerprint_related","node_a_id":"n-1336d058dca9979e","node_b_id":"n-bf0f86dc9ba61887","fingerprint":"f6-181e40cb14f29d52","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-181e40cb14f29d52"},"other_id":"n-bf0f86dc9ba61887","other":{"id":"n-bf0f86dc9ba61887","name":"basis_map_A013609 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.","first_index":0,"fingerprint":"f6-181e40cb14f29d52","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["4","2"],["32","24","4"]],"card_rows":[["1"],["4","2"],["32","24","4"],["384","352","96","8"]],"row_sums_preview":["1","6","60","840","15120","332640","8648640","259459200"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-9c5c208df8605708","steps":["basis A013609"],"edges":["e-8d6d917622b49386"],"text":"A225471 \u2192 basis A013609"},"headline":"A225471 \u2192 basis A013609","chain":null}},{"id":"l-4d6f8f09a1827f7f","kind":"fingerprint_related","node_a_id":"n-1336d058dca9979e","node_b_id":"n-fdb0bda32eba4618","fingerprint":"f6-181e40cb14f29d52","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-181e40cb14f29d52"},"other_id":"n-fdb0bda32eba4618","other":{"id":"n-fdb0bda32eba4618","name":"basis_map_A007318 of Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.","first_index":0,"fingerprint":"f6-181e40cb14f29d52","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","1"],["8","6","1"]],"card_rows":[["1"],["2","1"],["8","6","1"],["48","44","12","1"]],"row_sums_preview":["1","3","15","105","945","10395","135135","2027025"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4f6e747b794bcc2e","steps":["basis A007318"],"edges":["e-4ae5a85742c09b47"],"text":"A028338 \u2192 basis A007318"},"headline":"A028338 \u2192 basis A007318","chain":null}},{"id":"l-81fa4fc9f0c159ae","kind":"oeis_match","node_a_id":"n-1336d058dca9979e","node_b_id":null,"fingerprint":null,"oeis_id":"A204420","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":36},"in_catalog":true,"oeis_id":"A204420","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9696bc4bc4651858","kind":"oeis_match","node_a_id":"n-1336d058dca9979e","node_b_id":null,"fingerprint":null,"oeis_id":"A001818","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001818","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A204420","relation":"identification"},{"oeis_id":"A001818","relation":"match_row_sums"},{"oeis_id":"A204420","relation":"match_triangle"}],"bfiles":[{"node_id":"n-1336d058dca9979e","oeis_id":"A001818","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":16,"oeis_terms_available":16,"term_count":200,"raw_size":78648},{"node_id":"n-1336d058dca9979e","oeis_id":"A204420","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":36,"oeis_terms_agreeing":36,"oeis_terms_available":36,"term_count":990,"raw_size":66732}],"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: 0,               1;\n  2: 0,               6,               3;\n  3: 0,             120,              90,              15;\n  4: 0,            5040,            4620,            1260,            105;\n  5: 0,          362880,          378000,          132300,          18900,            945;\n  6: 0,        39916800,        45571680,        18711000,        3534300,         311850,         10395;\n  7: 0,      6227020800,      7628100480,      3511347840,      794593800,       94594500,       5675670,      135135;\n  8: 0,   1307674368000,   1695306412800,    851804553600,   219534915600,    31783752000,    2610808200,   113513400,    2027025;\n  9: 0, 355687428096000, 483353808537600, 260511047596800, 74194174454400, 12377274109200, 1250463614400, 75259384200, 2481078600, 34459425;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n^2-6*n+2+(2*n-1)*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 - 6*n + 2 + (2*n - 1)*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 - 6*n + 2 + (2*n - 1)*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}},{"oeis_id":"A204420","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 0,               1;\n  2: 0,               6,               3;\n  3: 0,             120,              90,              15;\n  4: 0,            5040,            4620,            1260,            105;\n  5: 0,          362880,          378000,          132300,          18900,            945;\n  6: 0,        39916800,        45571680,        18711000,        3534300,         311850,         10395;\n  7: 0,      6227020800,      7628100480,      3511347840,      794593800,       94594500,       5675670,      135135;\n  8: 0,   1307674368000,   1695306412800,    851804553600,   219534915600,    31783752000,    2610808200,   113513400,    2027025;\n  9: 0, 355687428096000, 483353808537600, 260511047596800, 74194174454400, 12377274109200, 1250463614400, 75259384200, 2481078600, 34459425;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (4*n^2-6*n+2+(2*n-1)*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 - 6*n + 2 + (2*n - 1)*x)*P[n - 1, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {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 - 6*n + 2 + (2*n - 1)*x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-1336d058dca9979e","steps":[],"edges":[],"text":"A204420"},"headline":"A204420: Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","chain":null}