{"id":"n-6202e291a2627bce","revision":1,"first_index":0,"fingerprint":"f6-cbfa13cb29880cff","name":"Triangle, row sums = number of edges in n-dimensional hypercubes.","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","3"],["1","6","5"],["1","9","15","7"],["1","12","30","28","9"],["1","15","50","70","45","11"],["1","18","75","140","135","66","13"],["1","21","105","245","315","231","91","15"],["1","24","140","392","630","616","364","120","17"],["1","27","180","588","1134","1386","1092","540","153","19"],["1","30","225","840","1890","2772","2730","1800","765","190","21"],["1","33","275","1155","2970","5082","6006","4950","2805","1045","231","23"],["1","36","330","1540","4455","8712","12012","11880","8415","4180","1386","276","25"],["1","39","390","2002","6435","14157","22308","25740","21879","13585","6006","1794","325","27"],["1","42","455","2548","9009","22022","39039","51480","51051","38038","21021","8372","2275","378","29"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","12","32","80","192","448","1024","2304","5120","11264","24576","53248","114688","245760"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A116666","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160280,"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-c4ea45619bc7f60a"]},{"id":160281,"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-c4ea45619bc7f60a"]},{"id":160282,"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-c4ea45619bc7f60a"]},{"id":160283,"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-c4ea45619bc7f60a"]}],"region_exact":{},"incoming_edges":[{"id":"e-c4ea45619bc7f60a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-6202e291a2627bce","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"6580de11f9bb807e8578c9762a110948d825390b03fb97951d43a68b72dbd1a9","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-c8c19eba9d68881f","role":"sequence","name":"binomial","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":[{"id":"e-1ff349e71c285f7b","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-b25ef4e45ac11736","conclusion_name":"one_plus_derivative of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-3ee1b8794cb4ceaf","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-18836b80f246710f","conclusion_name":"theta_plus_one of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-65d8be712199b442","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-d89ed6568fa97cb8","conclusion_name":"shift_x_plus_one of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-c033b30f4e233ccb","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-a492dc7276777329","conclusion_name":"mobius_x_over_x_plus_one of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-c51898909065bf38","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-c1f6a6363c73beb4","conclusion_name":"reversal of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-e317db6457cebe23","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-00cc3b258a483581","conclusion_name":"theta_plus_one_squared of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-ef8d93833f370225","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-19385c3577d7e359","conclusion_name":"derivative of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-c6d68d8f19f2fd56","operation":"veronese_section","operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-da67c10ced2035ea","conclusion_name":"veronese_section_2_0 of Triangle, row sums = number of edges in n-dimensional hypercubes."},{"id":"e-fce602c1f77fca99","operation":"veronese_section","operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-12574b7265731dfe","conclusion_name":"veronese_section_2_1 of Triangle, row sums = number of edges in n-dimensional hypercubes."}],"used_by_total":9,"links":[{"id":"l-469d394e31c1d7d5","kind":"fingerprint_related","node_a_id":"n-6202e291a2627bce","node_b_id":"n-698a3f7f3e3b2c70","fingerprint":"f6-cbfa13cb29880cff","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-cbfa13cb29880cff"},"other_id":"n-698a3f7f3e3b2c70","other":{"id":"n-698a3f7f3e3b2c70","name":"shift_x_plus_one of Triangle read by rows, (n-1) zeros followed by (2n, 1).","first_index":0,"fingerprint":"f6-cbfa13cb29880cff","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","1"],["5","6","1"]],"card_rows":[["1"],["3","1"],["5","6","1"],["7","15","9","1"]],"row_sums_preview":["1","4","12","32","80","192","448","1024"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6fea5aff4f44fa54","steps":["2D+1","x \u21a6 x+1"],"edges":["e-224384a428b81acf","e-fdc4f030d71c09e5"],"text":"A023531 \u2192 2D+1 \u2192 x \u21a6 x+1"},"headline":"A023531 \u2192 2D+1 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-7c783464c2756767","kind":"fingerprint_related","node_a_id":"n-6202e291a2627bce","node_b_id":"n-c1f6a6363c73beb4","fingerprint":"f6-cbfa13cb29880cff","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-cbfa13cb29880cff"},"other_id":"n-c1f6a6363c73beb4","other":{"id":"n-c1f6a6363c73beb4","name":"reversal of Triangle, row sums = number of edges in n-dimensional hypercubes.","first_index":0,"fingerprint":"f6-cbfa13cb29880cff","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","1"],["5","6","1"]],"card_rows":[["1"],["3","1"],["5","6","1"],["7","15","9","1"]],"row_sums_preview":["1","4","12","32","80","192","448","1024"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8c19eba9d68881f","steps":["2\u03b8+1","reverse"],"edges":["e-c4ea45619bc7f60a","e-c51898909065bf38"],"text":"A007318 \u2192 2\u03b8+1 \u2192 reverse"},"headline":"A007318 \u2192 2\u03b8+1 \u2192 reverse","chain":null}},{"id":"l-230e39c34869448f","kind":"oeis_match","node_a_id":"n-6202e291a2627bce","node_b_id":null,"fingerprint":null,"oeis_id":"A097067","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":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A097067","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-72569493084a97fb","kind":"oeis_match","node_a_id":"n-6202e291a2627bce","node_b_id":null,"fingerprint":null,"oeis_id":"A139756","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":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A139756","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-8183c23326f7d62f","kind":"oeis_match","node_a_id":"n-6202e291a2627bce","node_b_id":null,"fingerprint":null,"oeis_id":"A134083","in_catalog":0,"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":false,"oeis_id":"A134083","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-b6f60b7577ca0d78","kind":"oeis_match","node_a_id":"n-6202e291a2627bce","node_b_id":null,"fingerprint":null,"oeis_id":"A001787","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001787","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e8391ce030449768","kind":"oeis_match","node_a_id":"n-6202e291a2627bce","node_b_id":null,"fingerprint":null,"oeis_id":"A116666","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":1,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":61},"in_catalog":true,"oeis_id":"A116666","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A116666","relation":"identification"},{"oeis_id":"A134083","relation":"match_reversed_triangle"},{"oeis_id":"A001787","relation":"match_row_sums"},{"oeis_id":"A097067","relation":"match_row_sums"},{"oeis_id":"A139756","relation":"match_row_sums"},{"oeis_id":"A116666","relation":"match_triangle"}],"bfiles":[{"node_id":"n-6202e291a2627bce","oeis_id":"A116666","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":44,"terms_matched":61,"oeis_terms_agreeing":61,"oeis_terms_available":61,"term_count":990,"raw_size":11922},{"node_id":"n-6202e291a2627bce","oeis_id":"A134083","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":11920}],"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,  3;\n  2: 1,  6,   5;\n  3: 1,  9,  15,   7;\n  4: 1, 12,  30,  28,    9;\n  5: 1, 15,  50,  70,   45,   11;\n  6: 1, 18,  75, 140,  135,   66,   13;\n  7: 1, 21, 105, 245,  315,  231,   91,  15;\n  8: 1, 24, 140, 392,  630,  616,  364, 120,  17;\n  9: 1, 27, 180, 588, 1134, 1386, 1092, 540, 153, 19;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1+2*x+x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 + 2*x + x^2)*P[n - 2, 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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 1] - (1 + 2*x + x^2)*v[i - 2]); 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":"A116666","target":"triangle","first_row":0,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 1,  3;\n   3: 1,  6,   5;\n   4: 1,  9,  15,   7;\n   5: 1, 12,  30,  28,    9;\n   6: 1, 15,  50,  70,   45,   11;\n   7: 1, 18,  75, 140,  135,   66,   13;\n   8: 1, 21, 105, 245,  315,  231,   91,  15;\n   9: 1, 24, 140, 392,  630,  616,  364, 120,  17;\n  10: 1, 27, 180, 588, 1134, 1386, 1092, 540, 153, 19;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1+2*x+x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 3*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 + 2*x + x^2)*P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 3*x; for(n = 3, N, my(i = n); v[i] = (2 + 2*x)*v[i - 1] - (1 + 2*x + x^2)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A134083","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:  3,   1;\n  2:  5,   6,   1;\n  3:  7,  15,   9,    1;\n  4:  9,  28,  30,   12,    1;\n  5: 11,  45,  70,   50,   15,    1;\n  6: 13,  66, 135,  140,   75,   18,   1;\n  7: 15,  91, 231,  315,  245,  105,  21,   1;\n  8: 17, 120, 364,  616,  630,  392, 140,  24,  1;\n  9: 19, 153, 540, 1092, 1386, 1134, 588, 180, 27, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (2+2*x)*P(n-1,x) - (1+2*x+x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 + 2*x + x^2)*P[n - 2, 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; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 1] - (1 + 2*x + x^2)*v[i - 2]); 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}}],"derivation":{"root":"n-c8c19eba9d68881f","steps":["2\u03b8+1"],"edges":["e-c4ea45619bc7f60a"],"text":"A007318 \u2192 2\u03b8+1"},"headline":"A116666: Triangle, row sums = number of edges in n-dimensional hypercubes.","chain":"A007318 \u2192 2\u03b8+1"}