{"id":"n-84fc1826f57fd756","revision":1,"first_index":0,"fingerprint":"f6-b79b1b87544662ee","name":"A triangular decomposition of the double factorial numbers A001147.","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":false,"rows":[["1"],["0","1"],["0","2","1"],["0","4","10","1"],["0","8","60","36","1"],["0","16","296","516","116","1"],["0","32","1328","5168","3508","358","1"],["0","64","5664","42960","64240","21120","1086","1"],["0","128","23488","320064","900560","660880","118632","3272","1"],["0","256","95872","2225728","10725184","14713840","6049744","638968","9832","1"],["0","512","387840","14792448","114735936","265115424","205021488","51293760","3352152","29514","1"],["0","1024","1561088","95347968","1139774208","4142721408","5376527520","2563306032","412690752","17292012","88562","1"],["0","2048","6265856","601748480","10739109120","58523827200","118373708544","95028087168","29672806320","3200091480","88231300","265708","1"],["0","4096","25110528","3742073856","97346094080","767803127040","2298341910528","2869251431424","1520073859968","324656903520","24165266360","447002076","797148","1"],["0","8192","100544512","23029985280","857352303616","9527607057920","40632756086016","74644648697856","61621450368000","22564636723008","3405217458880","178990910192","2254141932","2391470","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"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:A185411","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-1"],["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":160391,"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-5c085bd25a6bcbdf"]},{"id":160392,"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-5c085bd25a6bcbdf"]},{"id":160393,"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-5c085bd25a6bcbdf"]}],"region_exact":{},"incoming_edges":[{"id":"e-5c085bd25a6bcbdf","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-84fc1826f57fd756","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"eb37ea6dcc032dbe2e28636b97a120bfa705927b29de3171bd5065c30b4b676e","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-54b58a0ddb0e34fe","role":"sequence","name":"A decomposition of the double factorials A001147.","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":[{"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-54b58a0ddb0e34fe","other":{"id":"n-54b58a0ddb0e34fe","name":"A decomposition of the double factorials A001147.","first_index":0,"fingerprint":"f6-b79b1b87544662ee","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","2"]],"card_rows":[["1"],["1"],["1","2"],["1","10","4"]],"row_sums_preview":["1","1","3","15","105","945","10395","135135"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A185410"],"derivation":{"root":"n-54b58a0ddb0e34fe","steps":[],"edges":[],"text":"A185410"},"headline":"A185410: A decomposition of the double factorials A001147.","chain":null}},{"id":"l-2db2267e9c6c4c89","kind":"oeis_match","node_a_id":"n-84fc1826f57fd756","node_b_id":null,"fingerprint":null,"oeis_id":"A185410","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A185410","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-438c78e978ebfd62","kind":"oeis_match","node_a_id":"n-84fc1826f57fd756","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-5e5178666ca83ba8","kind":"oeis_match","node_a_id":"n-84fc1826f57fd756","node_b_id":null,"fingerprint":null,"oeis_id":"A156919","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":8,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":true,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":8,"target":"triangle","terms_compared":39},"in_catalog":false,"oeis_id":"A156919","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9d584e43f1a6c313","kind":"oeis_match","node_a_id":"n-84fc1826f57fd756","node_b_id":null,"fingerprint":null,"oeis_id":"A185411","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A185411","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A185411","relation":"identification"},{"oeis_id":"A185410","relation":"match_reversed_triangle"},{"oeis_id":"A001147","relation":"match_row_sums"},{"oeis_id":"A156919","relation":"match_triangle"},{"oeis_id":"A185411","relation":"match_triangle"}],"bfiles":[{"node_id":"n-84fc1826f57fd756","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-84fc1826f57fd756","oeis_id":"A156919","target":"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},{"node_id":"n-84fc1826f57fd756","oeis_id":"A185410","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":34164},{"node_id":"n-84fc1826f57fd756","oeis_id":"A185411","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":34164}],"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,   2,     1;\n  3: 0,   4,    10,       1;\n  4: 0,   8,    60,      36,        1;\n  5: 0,  16,   296,     516,      116,        1;\n  6: 0,  32,  1328,    5168,     3508,      358,       1;\n  7: 0,  64,  5664,   42960,    64240,    21120,    1086,      1;\n  8: 0, 128, 23488,  320064,   900560,   660880,  118632,   3272,    1;\n  9: 0, 256, 95872, 2225728, 10725184, 14713840, 6049744, 638968, 9832, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1)*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[(2*n - 1)*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] = (2*n - 1)*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":"triangle","first_row":1,"oeis_offset":0,"reversed":false,"trim_zeros":"low","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 ascending powers of x, starting at the lowest nonzero coefficient, where P(n,x) = (2*n+1)*x*P(n-1,x) + (2*x-2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = x.","mathematica":"P[0, x_] := x;\nP[n_, x_] := P[n, x] = Expand[(2*n + 1)*x*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x]];\nTable[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = x; for(n = 1, N, my(i = n + 1); v[i] = (2*n + 1)*x*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], x)); v};\nrow(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); 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":1,"offset":0,"reversed":false,"trim_zeros":"low","regular_triangle":true}},{"oeis_id":"A185410","target":"reversed_triangle","first_row":0,"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: 1,    0;\n  2: 1,    2,      0;\n  3: 1,   10,      4,       0;\n  4: 1,   36,     60,       8,        0;\n  5: 1,  116,    516,     296,       16,        0;\n  6: 1,  358,   3508,    5168,     1328,       32,       0;\n  7: 1, 1086,  21120,   64240,    42960,     5664,      64,     0;\n  8: 1, 3272, 118632,  660880,   900560,   320064,   23488,   128,   0;\n  9: 1, 9832, 638968, 6049744, 14713840, 10725184, 2225728, 95872, 256, 0;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2*n-1)*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[(2*n - 1)*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] = (2*n - 1)*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":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A185411","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,   2,     1;\n  3: 0,   4,    10,       1;\n  4: 0,   8,    60,      36,        1;\n  5: 0,  16,   296,     516,      116,        1;\n  6: 0,  32,  1328,    5168,     3508,      358,       1;\n  7: 0,  64,  5664,   42960,    64240,    21120,    1086,      1;\n  8: 0, 128, 23488,  320064,   900560,   660880,  118632,   3272,    1;\n  9: 0, 256, 95872, 2225728, 10725184, 14713840, 6049744, 638968, 9832, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1)*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[(2*n - 1)*x*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], 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] = (2*n - 1)*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};\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-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"}