{"id":"n-d8f9ad9ce0e039d0","revision":2,"first_index":0,"fingerprint":"f6-e6273f3a89305dfc","name":"Pascal-(1,3,1) array.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","1"],["1","5","1"],["1","9","9","1"],["1","13","33","13","1"],["1","17","73","73","17","1"],["1","21","129","245","129","21","1"],["1","25","201","593","593","201","25","1"],["1","29","289","1181","1921","1181","289","29","1"],["1","33","393","2073","4881","4881","2073","393","33","1"],["1","37","513","3333","10497","15525","10497","3333","513","37","1"],["1","41","649","5025","20049","40665","40665","20049","5025","649","41","1"],["1","45","801","7213","35073","92205","127905","92205","35073","7213","801","45","1"],["1","49","969","9961","57361","187425","342105","342105","187425","57361","9961","969","49","1"],["1","53","1153","13333","88961","350005","806145","1067925","806145","350005","88961","13333","1153","53","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","7","20","61","182","547","1640","4921","14762","44287","132860","398581","1195742","3587227"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A081578","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","3"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-24db884b67815d46","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","1"],["1","-3","-1"],["0","4","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","21","3"],["0","-1","-14","-1"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1","14","1"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158884,"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-fba968684828f914"]},{"id":158885,"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-86685874cd5f1179","e-fba968684828f914"]},{"id":158886,"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-86685874cd5f1179","e-fba968684828f914"]},{"id":158887,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-fba968684828f914"]},{"id":158888,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), -3 + sqrt(12)]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has a real-rooted image"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-3 - sqrt(12), -3 + sqrt(12)] to roots in (-inf, +inf): every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has a real-rooted image","region_exact":null,"edges":["e-8caea9461a47d8d9"]},{"id":158889,"position":5,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), -3 + sqrt(12)]","output_interval":"[-7 - 2 sqrt(12), -7 + 2 sqrt(12)]","statement":"every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has an image with all roots in I = [-7 - 2 sqrt(12), -7 + 2 sqrt(12)]"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-3 - sqrt(12), -3 + sqrt(12)] to roots in [-7 - 2 sqrt(12), -7 + 2 sqrt(12)]: every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has an image with all roots in I = [-7 - 2 sqrt(12), -7 + 2 sqrt(12)]","region_exact":null,"edges":["e-8caea9461a47d8d9"]},{"id":158890,"position":6,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), 0]","output_interval":"[-7 - 2 sqrt(12), -7 + 2 sqrt(12)]","statement":"every PF input with all roots in [-3 - sqrt(12), 0] has a PF image; no larger [-R, 0] works"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-3 - sqrt(12), 0] to roots in [-7 - 2 sqrt(12), -7 + 2 sqrt(12)]: every PF input with all roots in [-3 - sqrt(12), 0] has a PF image; no larger [-R, 0] works","region_exact":null,"edges":["e-8caea9461a47d8d9"]},{"id":158891,"position":7,"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-86685874cd5f1179"]}],"region_exact":{},"incoming_edges":[{"id":"e-8caea9461a47d8d9","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-d8f9ad9ce0e039d0","premise_count":0,"theorem":"affine current multiplier with an affine initial row (module documentation, \"The affine-current theorem\"): with beta = b/d, K = beta^2 + a beta - c > 0 and eta = m/d >= 0, every real polynomial with all roots in E = [-beta - sqrt(K), -beta + sqrt(K)] has a real-rooted image, and no interval of positive length outside E works (Theorem 1); for eta > 0 the images lie in I = [(-a - 2 beta - 2 sqrt(K))/d, (-a - 2 beta + 2 sqrt(K))/d] if and only if eta >= 1/2 and (s - (2 eta - 1) beta)^2 <= (2 eta - 1)^2 K, s = l - eta a (Theorem 2); with a >= 0, K >= beta^2, a + 2 beta >= 0, a^2 + 4c >= 0, l >= 0 and the scalar criterion, PF inputs with roots in [-R, 0], R = beta + sqrt(K), have PF images, sharply (the common-interlacer proof; the Chebyshev case is Iserles and Saff, Math. Proc. Cambridge Philos. Soc. 105 (1989), Theorem 1; the scalar criterion is RealRooted orderTwoConstants_nonneg_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"fdd72ea525e61356a6e2f467357af22da761f1a804a53e4b563539e85d41c2b6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), -3 + sqrt(12)]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has a real-rooted image"},{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), -3 + sqrt(12)]","output_interval":"[-7 - 2 sqrt(12), -7 + 2 sqrt(12)]","statement":"every real polynomial with all roots in E = [-3 - sqrt(12), -3 + sqrt(12)] has an image with all roots in I = [-7 - 2 sqrt(12), -7 + 2 sqrt(12)]"},{"claim":"basis_map_preserver","input_interval":"[-3 - sqrt(12), 0]","output_interval":"[-7 - 2 sqrt(12), -7 + 2 sqrt(12)]","statement":"every PF input with all roots in [-3 - sqrt(12), 0] has a PF image; no larger [-R, 0] works"}],"premises":[]},{"id":"e-24db884b67815d46","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-d8f9ad9ce0e039d0","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"2137d54102975541b43340cf701eb5c10e61f08bc0f0a03881f202afb771444f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-86685874cd5f1179","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-d8f9ad9ce0e039d0","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":"6a31a8fa9dab3414e75931e0932d9e5eb28a881491d1a8663cbc73fa86aba09d","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-d8f9ad9ce0e039d0","role":"sequence","name":"Pascal-(1,3,1) array.","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-fba968684828f914","operation":{"operation":"theorem_check","theorem":"liu_wang_derivative_lag"},"operation_detail":"liu_wang_derivative_lag","conclusion_id":"n-d8f9ad9ce0e039d0","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 the interlacers f' and the lag row (strict form, as in the derivative-lag theorems of the RealRooted library, https://github.com/PerAlexandersson/RealRooted), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_nonnegCoeffs","RealRooted.LiuWang.strictInterl_nonpos_lag_sequence"],"certificate_hash":"5041990a59652867a905aa4e63598d9b7fc553faa1a71cb766349d5a110fba98","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":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-76167bab816eda7c","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-bfe76bb735cd71bb","conclusion_name":"basis_map_A007318 of Pascal-(1,3,1) array."},{"id":"e-8a4711c2a1f3d5ab","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-0a3016fdb5b100ef","conclusion_name":"basis_map_A013611 of Pascal-(1,3,1) array."},{"id":"e-adc7ee5e7b9e07e0","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-bc5a0b609d6731da","conclusion_name":"basis_map_A008277 of Pascal-(1,3,1) array."},{"id":"e-d7f638723d064edd","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-c1d69b4cd7e1b71e","conclusion_name":"basis_map_A013609 of Pascal-(1,3,1) array."},{"id":"e-e2e410202685a847","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-9813839be9bee901","conclusion_name":"basis_map_A013610 of Pascal-(1,3,1) array."},{"id":"e-64b74724257dbeaa","operation":"gamma_polynomial","operation_detail":"scale 1, shift 0","conclusion_id":"n-e189038e95d51606","conclusion_name":"Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows."},{"id":"e-1706bc42be491225","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-39b75e31cd9eebf3","conclusion_name":"theta_plus_one of Pascal-(1,3,1) array."},{"id":"e-46aa838b7dbd44c5","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-bfe76bb735cd71bb","conclusion_name":"basis_map_A007318 of Pascal-(1,3,1) array."},{"id":"e-4c6b05990c1dd2cb","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-023550bcf4f9b8f1","conclusion_name":"one_plus_derivative of Pascal-(1,3,1) array."},{"id":"e-80bca760e085f131","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-e2ce22500c32dd0c","conclusion_name":"theta_plus_one_squared of Pascal-(1,3,1) array."},{"id":"e-86685874cd5f1179","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-d8f9ad9ce0e039d0","conclusion_name":"Pascal-(1,3,1) array."},{"id":"e-923647fd37394295","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-67cce3037dca960d","conclusion_name":"mobius_x_over_x_plus_one of Pascal-(1,3,1) array."},{"id":"e-fd64a74b37db6ad7","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-5d7aa830bd831f2a","conclusion_name":"derivative of Pascal-(1,3,1) array."},{"id":"e-675edb68e3f27703","operation":"veronese_section","operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-2e518025684ef657","conclusion_name":"veronese_section_2_0 of Pascal-(1,3,1) array."},{"id":"e-7f094088edb1ffb9","operation":"veronese_section","operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-51db1bab4dd4782f","conclusion_name":"veronese_section_2_1 of Pascal-(1,3,1) array."}],"used_by_total":15,"links":[{"id":"l-309a5e577bf56380","kind":"oeis_match","node_a_id":"n-d8f9ad9ce0e039d0","node_b_id":null,"fingerprint":null,"oeis_id":"A015518","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":"A015518","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-39837aa9948cdd80","kind":"oeis_match","node_a_id":"n-d8f9ad9ce0e039d0","node_b_id":null,"fingerprint":null,"oeis_id":"A081578","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"reversed_triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A081578","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f995f91a681ed503","kind":"oeis_match","node_a_id":"n-d8f9ad9ce0e039d0","node_b_id":null,"fingerprint":null,"oeis_id":"A081578","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A081578","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A081578","relation":"identification"},{"oeis_id":"A081578","relation":"match_reversed_triangle"},{"oeis_id":"A015518","relation":"match_row_sums"},{"oeis_id":"A081578","relation":"match_triangle"}],"bfiles":[{"node_id":"n-d8f9ad9ce0e039d0","oeis_id":"A081578","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":13786},{"node_id":"n-d8f9ad9ce0e039d0","oeis_id":"A081578","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":13786}],"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,  1;\n  2: 1,  5,   1;\n  3: 1,  9,   9,    1;\n  4: 1, 13,  33,   13,    1;\n  5: 1, 17,  73,   73,   17,    1;\n  6: 1, 21, 129,  245,  129,   21,    1;\n  7: 1, 25, 201,  593,  593,  201,   25,   1;\n  8: 1, 29, 289, 1181, 1921, 1181,  289,  29,  1;\n  9: 1, 33, 393, 2073, 4881, 4881, 2073, 393, 33, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + 3*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + 3*x*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 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + 3*x*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":"A081578","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: 1,  1;\n  2: 1,  5,   1;\n  3: 1,  9,   9,    1;\n  4: 1, 13,  33,   13,    1;\n  5: 1, 17,  73,   73,   17,    1;\n  6: 1, 21, 129,  245,  129,   21,    1;\n  7: 1, 25, 201,  593,  593,  201,   25,   1;\n  8: 1, 29, 289, 1181, 1921, 1181,  289,  29,  1;\n  9: 1, 33, 393, 2073, 4881, 4881, 2073, 393, 33, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+x)*P(n-1,x) + 3*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + 3*x*P[n - 2, 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; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + 3*x*v[i - 2]); 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":"A081578","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,  1;\n  2: 1,  5,   1;\n  3: 1,  9,   9,    1;\n  4: 1, 13,  33,   13,    1;\n  5: 1, 17,  73,   73,   17,    1;\n  6: 1, 21, 129,  245,  129,   21,    1;\n  7: 1, 25, 201,  593,  593,  201,   25,   1;\n  8: 1, 29, 289, 1181, 1921, 1181,  289,  29,  1;\n  9: 1, 33, 393, 2073, 4881, 4881, 2073, 393, 33, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+x)*P(n-1,x) + 3*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 1, x] + 3*x*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 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 1] + 3*x*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-d8f9ad9ce0e039d0","steps":[],"edges":[],"text":"A081578"},"headline":"A081578: Pascal-(1,3,1) array.","chain":null}