{"id":"n-e5e648370a9e4459","revision":2,"first_index":0,"fingerprint":"f6-63d3891a7d0f6d93","name":"Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^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"],["2","1"],["8","10","3"],["32","64","42","9"],["128","352","360","162","27"],["512","1792","2496","1728","594","81"],["2048","8704","15360","14400","7560","2106","243"],["8192","40960","87552","103680","73440","31104","7290","729"],["32768","188416","473088","677376","604800","344736","122472","24786","2187"],["131072","851968","2457600","4128768","4451328","3193344","1524096","466560","83106","6561"],["524288","3801088","12386304","23887872","30191616","26127360","15676416","6438528","1732104","275562","19683"],["2097152","16777216","60948480","132710400","192430080","195084288","141087744","72783360","26244000","6298560","905418","59049"],["8388608","73400320","294125568","713687040","1167851520","1357627392","1149603840","714396672","323326080","103926240","22517352","2952450","177147"],["33554432","318767104","1396703232","3737124864","6812467200","8934064128","8671297536","6306398208","3436494336","1385683200","401848128","79361856","9565938","531441"],["134217728","1375731712","6543114240","19138609152","38461243392","56173658112","61487382528","51239485440","32665171968","15852215808","5764442112","1522991808","276349320","30823578","1594323"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","21","147","1029","7203","50421","352947","2470629","17294403","121060821","847425747","5931980229","41523861603","290667031221"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A193728","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-3"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169641,"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-316a5efcd3478cb2","e-3c6fe24bab85a406"]},{"id":169642,"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-1ebf159add27f7fc","e-316a5efcd3478cb2","e-3c6fe24bab85a406","e-bc7c2cf81eba631a"]},{"id":169643,"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-1ebf159add27f7fc","e-316a5efcd3478cb2","e-3c6fe24bab85a406","e-bc7c2cf81eba631a"]},{"id":169644,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-316a5efcd3478cb2"]},{"id":169645,"position":4,"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-1ebf159add27f7fc","e-bc7c2cf81eba631a"]},{"id":169646,"position":5,"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-1ebf159add27f7fc"]},{"id":170777,"position":6,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-bc7c2cf81eba631a"]}],"region_exact":{},"incoming_edges":[{"id":"e-bc7c2cf81eba631a","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-e5e648370a9e4459","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":"67eb6bee3ae2027da3dee1b6c84d57427fe938edbd12f6674dc9610dc03b1aab","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-685ab5842fbad7f4","role":"sequence","name":"Triangular matrix arising in enumeration of catafusenes, read by rows.","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]"}]},{"id":"e-1ebf159add27f7fc","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-e5e648370a9e4459","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"85c0c5570beab39a027379d85bf34b6117d2cf74ffebb7413433027ffac7b11a","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":"previous_interlaces_next"}],"premises":[]},{"id":"e-316a5efcd3478cb2","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-e5e648370a9e4459","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":"5a771c3af4b73722807ca6c07099727d7ad8c9f38160593f1d46a77424083e6c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-3c6fe24bab85a406","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-e5e648370a9e4459","premise_count":0,"theorem":"Row-hypergeometric rows: an exact row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, proved for every n by an invariant row-annihilator system of the rule, writes every row as U_0(n) x^v (or its reversal) times the image of (1 + x)^M(n) under a product of nonnegative multiplier sequences: C^k (C > 0); k -> M'!/(M' - k)!, whose exponential generating function is (1 + x)^M' (Polya--Schur, Theorem 7.1 (3) => (1) of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601: a sequence is a multiplier sequence when G(x) = sum_k lambda_k x^k / k! or G(-x) can be written C x^m e^(a x) prod_k (1 + alpha_k x) with a >= 0, alpha_k >= 0); k -> phi(k) for a polynomial phi with only real roots, all <= 0 (Laguerre's theorem, RealRooted isPFMultiplierSequence_eval_of_roots_nonpos); k -> 1/(alpha)_k for alpha > 0 (RealRooted isPFMultiplierSequence_inv_ascPochhammer, via the generalized Laguerre polynomials); products of PF multiplier sequences are PF multiplier sequences (RealRooted IsPFMultiplierSequence.mul) and map real-rooted polynomials with nonnegative coefficients to such polynomials (IsPFMultiplierSequence.diagonalOperator_isPF)","lean_route":null,"lean_declarations":["RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_inv_ascPochhammer","RealRooted.IsPFMultiplierSequence.mul","RealRooted.IsPFMultiplierSequence.diagonalOperator_isPF"],"certificate_hash":"3941e4c08c4533bd11fcb9bb88799a5e19e749dc4657b103b492e60d48d365d2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-1dbb1313824e87b2","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-3ea85608b09f4ba1","conclusion_name":"basis_map_A013609 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n."},{"id":"e-4280066d4afc1df9","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-1eed1bfa73c23c94","conclusion_name":"basis_map_A013610 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n."},{"id":"e-57ab107dbf9aaa09","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-c64552a43a5cbc3b","conclusion_name":"basis_map_A013611 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n."},{"id":"e-7ea3144422b7744c","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-2e808b38f468bcfa","conclusion_name":"basis_map_A007318 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n."},{"id":"e-a78f78fa25a65fe2","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-a5563cc5abf58a87","conclusion_name":"basis_map_A008277 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n."}],"used_by_total":5,"links":[{"id":"l-3a852bb82b525f99","kind":"fingerprint_related","node_a_id":"n-e5e648370a9e4459","node_b_id":"n-c6ca397ede50cf7f","fingerprint":"f6-63d3891a7d0f6d93","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-63d3891a7d0f6d93"},"other_id":"n-c6ca397ede50cf7f","other":{"id":"n-c6ca397ede50cf7f","name":"Mirror of the triangle A193728.","first_index":0,"fingerprint":"f6-63d3891a7d0f6d93","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","2"],["3","10","8"]],"card_rows":[["1"],["1","2"],["3","10","8"],["9","42","64","32"]],"row_sums_preview":["1","3","21","147","1029","7203","50421","352947"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A193729"],"derivation":{"root":"n-c6ca397ede50cf7f","steps":[],"edges":[],"text":"A193729"},"headline":"A193729: Mirror of the triangle A193728.","chain":null}},{"id":"l-c8d4d3c93230f9cf","kind":"fingerprint_related","node_a_id":"n-e5e648370a9e4459","node_b_id":"n-05e1b9bf0c57a81d","fingerprint":"f6-63d3891a7d0f6d93","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-63d3891a7d0f6d93"},"other_id":"n-05e1b9bf0c57a81d","other":{"id":"n-05e1b9bf0c57a81d","name":"basis_map_A013611 of Triangle T(n,k), read by rows, given by (1,1,0,0,0,0,0,0,0,...) DELTA (1,0,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.","first_index":1,"fingerprint":"f6-63d3891a7d0f6d93","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2","4"],["6","20","16"]],"card_rows":[["1"],["2","4"],["6","20","16"],["18","84","128","64"]],"row_sums_preview":["1","6","42","294","2058","14406","100842","705894"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-f2a2a3d7ea29bcbf","steps":["basis A013611"],"edges":["e-7b42121ac1319bc3"],"text":"A200139 \u2192 basis A013611"},"headline":"A200139 \u2192 basis A013611","chain":null}},{"id":"l-27a6ce8767cad994","kind":"oeis_match","node_a_id":"n-e5e648370a9e4459","node_b_id":null,"fingerprint":null,"oeis_id":"A193728","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A193728","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6ffef01625f02a50","kind":"oeis_match","node_a_id":"n-e5e648370a9e4459","node_b_id":null,"fingerprint":null,"oeis_id":"A169634","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A169634","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f32e47f1ed0b4dc6","kind":"oeis_match","node_a_id":"n-e5e648370a9e4459","node_b_id":null,"fingerprint":null,"oeis_id":"A193729","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"reversed_triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A193729","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A193728","relation":"identification"},{"oeis_id":"A193729","relation":"match_reversed_triangle"},{"oeis_id":"A169634","relation":"match_row_sums"},{"oeis_id":"A193728","relation":"match_triangle"}],"bfiles":[{"node_id":"n-e5e648370a9e4459","oeis_id":"A169634","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":22,"oeis_terms_available":22,"term_count":200,"raw_size":17903},{"node_id":"n-e5e648370a9e4459","oeis_id":"A193728","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":25553},{"node_id":"n-e5e648370a9e4459","oeis_id":"A193729","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":25553}],"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:      2,      1;\n  2:      8,     10,       3;\n  3:     32,     64,      42,       9;\n  4:    128,    352,     360,     162,      27;\n  5:    512,   1792,    2496,    1728,     594,      81;\n  6:   2048,   8704,   15360,   14400,    7560,    2106,     243;\n  7:   8192,  40960,   87552,  103680,   73440,   31104,    7290,    729;\n  8:  32768, 188416,  473088,  677376,  604800,  344736,  122472,  24786,  2187;\n  9: 131072, 851968, 2457600, 4128768, 4451328, 3193344, 1524096, 466560, 83106, 6561;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 4 + (3*n - 3)*x)*v[i - 1])/(n - 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":"A193728","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:      2,      1;\n  2:      8,     10,       3;\n  3:     32,     64,      42,       9;\n  4:    128,    352,     360,     162,      27;\n  5:    512,   1792,    2496,    1728,     594,      81;\n  6:   2048,   8704,   15360,   14400,    7560,    2106,     243;\n  7:   8192,  40960,   87552,  103680,   73440,   31104,    7290,    729;\n  8:  32768, 188416,  473088,  677376,  604800,  344736,  122472,  24786,  2187;\n  9: 131072, 851968, 2457600, 4128768, 4451328, 3193344, 1524096, 466560, 83106, 6561;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];\nTable[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] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 4 + (3*n - 3)*x)*v[i - 1])/(n - 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}},{"oeis_id":"A193729","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,     2;\n  2:    3,    10,      8;\n  3:    9,    42,     64,      32;\n  4:   27,   162,    360,     352,     128;\n  5:   81,   594,   1728,    2496,    1792,     512;\n  6:  243,  2106,   7560,   14400,   15360,    8704,    2048;\n  7:  729,  7290,  31104,   73440,  103680,   87552,   40960,    8192;\n  8: 2187, 24786, 122472,  344736,  604800,  677376,  473088,  188416,  32768;\n  9: 6561, 83106, 466560, 1524096, 3193344, 4451328, 4128768, 2457600, 851968, 131072;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (4*n-4+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];\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] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 4 + (3*n - 3)*x)*v[i - 1])/(n - 1)); 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-e5e648370a9e4459","steps":[],"edges":[],"text":"A193728"},"headline":"A193728: Triangular array: the fusion of polynomial sequences P and Q given by p(n,x) = (x+2)^n and q(n,x) = (2*x+1)^n.","chain":null}