{"id":"n-54b58a0ddb0e34fe","revision":1,"first_index":0,"fingerprint":"f6-b79b1b87544662ee","name":"A decomposition of the double factorials A001147.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","10","4"],["1","36","60","8"],["1","116","516","296","16"],["1","358","3508","5168","1328","32"],["1","1086","21120","64240","42960","5664","64"],["1","3272","118632","660880","900560","320064","23488","128"],["1","9832","638968","6049744","14713840","10725184","2225728","95872","256"],["1","29514","3352152","51293760","205021488","265115424","114735936","14792448","387840","512"],["1","88562","17292012","412690752","2563306032","5376527520","4142721408","1139774208","95347968","1561088","1024"],["1","265708","88231300","3200091480","29672806320","95028087168","118373708544","58523827200","10739109120","601748480","6265856","2048"],["1","797148","447002076","24165266360","324656903520","1520073859968","2869251431424","2298341910528","767803127040","97346094080","3742073856","25110528","4096"],["1","2391470","2254141932","178990910192","3405217458880","22564636723008","61621450368000","74644648697856","40632756086016","9527607057920","857352303616","23029985280","100544512","8192"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","3","15","105","945","10395","135135","2027025","34459425","654729075","13749310575","316234143225","7905853580625","213458046676875"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A185410","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","-2"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159552,"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":false,"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-e2b66c2a000699df"]},{"id":159553,"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-e2b66c2a000699df"]},{"id":159554,"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-e2b66c2a000699df"]},{"id":159555,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-e2b66c2a000699df"]}],"region_exact":{},"incoming_edges":[{"id":"e-e2b66c2a000699df","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-54b58a0ddb0e34fe","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"4fd412a08236fad19017f61e2d2c8aa2195c55260bb033a563774cec01251171","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-261fc200d1c6c7f8","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-c9ad85130c4da295","conclusion_name":"obreschkoff_combination of A decomposition of the double factorials A001147."},{"id":"e-261fc200d1c6c7f8","operation":"obreschkoff_combination","operation_detail":null,"conclusion_id":"n-c9ad85130c4da295","conclusion_name":"obreschkoff_combination of A decomposition of the double factorials A001147."},{"id":"e-5c085bd25a6bcbdf","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-84fc1826f57fd756","conclusion_name":"A triangular decomposition of the double factorial numbers A001147."}],"used_by_total":3,"links":[{"id":"l-3955f60820c9da0f","kind":"fingerprint_related","node_a_id":"n-54b58a0ddb0e34fe","node_b_id":"n-84fc1826f57fd756","fingerprint":"f6-b79b1b87544662ee","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-b79b1b87544662ee"},"other_id":"n-84fc1826f57fd756","other":{"id":"n-84fc1826f57fd756","name":"A triangular decomposition of the double factorial numbers A001147.","first_index":0,"fingerprint":"f6-b79b1b87544662ee","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","2","1"]],"card_rows":[["1"],["0","1"],["0","2","1"],["0","4","10","1"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A185411"],"derivation":{"root":"n-54b58a0ddb0e34fe","steps":["reverse"],"edges":["e-5c085bd25a6bcbdf"],"text":"A185410 \u2192 reverse"},"headline":"A185411: A triangular decomposition of the double factorial numbers A001147.","chain":"A185410 \u2192 reverse"}},{"id":"l-156503aef0fd3d4a","kind":"oeis_match","node_a_id":"n-54b58a0ddb0e34fe","node_b_id":null,"fingerprint":null,"oeis_id":"A001147","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":"A001147","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9698e9d0c4c65a9c","kind":"oeis_match","node_a_id":"n-54b58a0ddb0e34fe","node_b_id":null,"fingerprint":null,"oeis_id":"A156919","in_catalog":0,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"reversed_triangle","terms_compared":39},"in_catalog":false,"oeis_id":"A156919","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A185410","relation":"identification"},{"oeis_id":"A156919","relation":"match_reversed_triangle"},{"oeis_id":"A001147","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-54b58a0ddb0e34fe","oeis_id":"A001147","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":39820},{"node_id":"n-54b58a0ddb0e34fe","oeis_id":"A156919","target":"reversed_triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":39,"oeis_terms_agreeing":39,"oeis_terms_available":39,"term_count":990,"raw_size":36451}],"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: 1,    2;\n  3: 1,   10,      4;\n  4: 1,   36,     60,       8;\n  5: 1,  116,    516,     296,       16;\n  6: 1,  358,   3508,    5168,     1328,       32;\n  7: 1, 1086,  21120,   64240,    42960,     5664,      64;\n  8: 1, 3272, 118632,  660880,   900560,   320064,   23488,   128;\n  9: 1, 9832, 638968, 6049744, 14713840, 10725184, 2225728, 95872, 256;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(2*n-2)*x)*P(n-1,x) + (2*x-2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + (2*n - 2)*x)*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], 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] = (1 + (2*n - 2)*x)*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], x)); 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":"A156919","target":"reversed_triangle","first_row":1,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:   1;\n  1:   2,      1;\n  2:   4,     10,        1;\n  3:   8,     60,       36,         1;\n  4:  16,    296,      516,       116,         1;\n  5:  32,   1328,     5168,      3508,       358,         1;\n  6:  64,   5664,    42960,     64240,     21120,      1086,        1;\n  7: 128,  23488,   320064,    900560,    660880,    118632,     3272,       1;\n  8: 256,  95872,  2225728,  10725184,  14713840,   6049744,   638968,    9832,     1;\n  9: 512, 387840, 14792448, 114735936, 265115424, 205021488, 51293760, 3352152, 29514, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+2*n*x)*P(n-1,x) + (2*x-2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + 2*n*x)*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x]];\nTable[Reverse[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] = (1 + 2*n*x)*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-54b58a0ddb0e34fe","steps":[],"edges":[],"text":"A185410"},"headline":"A185410: A decomposition of the double factorials A001147.","chain":null}