{"id":"n-4ad294e2bfbb52a6","revision":0,"first_index":0,"fingerprint":"f6-fd2eb6e3f0c1aca6","name":"Triangle read by rows: T(n,k) is the number of 2-compositions of n having length k (0 <= k <= 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":false,"rows":[["1"],["0","2"],["0","3","4"],["0","4","12","8"],["0","5","25","36","16"],["0","6","44","102","96","32"],["0","7","70","231","344","240","64"],["0","8","104","456","952","1040","576","128"],["0","9","147","819","2241","3400","2928","1344","256"],["0","10","200","1372","4712","9290","11040","7840","3072","512"],["0","11","264","2178","9108","22363","34332","33488","20224","6912","1024"],["0","12","340","3312","16488","48940","93060","116760","96512","50688","15360","2048"],["0","13","429","4862","28314","99385","227305","351820","372832","267264","124160","33792","4096"],["0","14","532","6930","46552","189970","511380","948430","1236032","1132992","716800","298496","73728","8192"],["0","15","650","9633","73788","345345","1076010","2340495","3644272","4097952","3308160","1872640","706560","159744","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","7","24","82","280","956","3264","11144","38048","129904","443520","1514272","5170048","17651648"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A181289","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","2"],["0","3","4"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-4"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","2"],["-1","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169613,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[-1, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, +inf)","region_exact":null,"edges":["e-6eebb6934276f7fa"]},{"id":169614,"position":1,"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-6eebb6934276f7fa"]}],"region_exact":{},"incoming_edges":[{"id":"e-6eebb6934276f7fa","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-4ad294e2bfbb52a6","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":null,"lean_declarations":["RealRooted.threeTerm_interlaces_of_window"],"certificate_hash":"629b99b54c67703c799a5a9059d6b79f4c8f6afee9cea484a8853c128b29fe58","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-6c5bacc1f05fbb2f","kind":"oeis_match","node_a_id":"n-4ad294e2bfbb52a6","node_b_id":null,"fingerprint":null,"oeis_id":"A003480","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":"A003480","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-add1cd912dcb9a5a","kind":"oeis_match","node_a_id":"n-4ad294e2bfbb52a6","node_b_id":null,"fingerprint":null,"oeis_id":"A181289","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":61},"in_catalog":true,"oeis_id":"A181289","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-bf4375eb64fcbf88","kind":"oeis_match","node_a_id":"n-4ad294e2bfbb52a6","node_b_id":null,"fingerprint":null,"oeis_id":"A020727","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":"A020727","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A181289","relation":"identification"},{"oeis_id":"A003480","relation":"match_row_sums"},{"oeis_id":"A020727","relation":"match_row_sums"},{"oeis_id":"A181289","relation":"match_triangle"}],"bfiles":[{"node_id":"n-4ad294e2bfbb52a6","oeis_id":"A003480","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":28,"oeis_terms_available":28,"term_count":200,"raw_size":11557},{"node_id":"n-4ad294e2bfbb52a6","oeis_id":"A020727","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":11663},{"node_id":"n-4ad294e2bfbb52a6","oeis_id":"A181289","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":61,"oeis_terms_agreeing":61,"oeis_terms_available":61,"term_count":990,"raw_size":16080}],"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,  2;\n  2: 0,  3,   4;\n  3: 0,  4,  12,    8;\n  4: 0,  5,  25,   36,   16;\n  5: 0,  6,  44,  102,   96,   32;\n  6: 0,  7,  70,  231,  344,  240,    64;\n  7: 0,  8, 104,  456,  952, 1040,   576,  128;\n  8: 0,  9, 147,  819, 2241, 3400,  2928, 1344,  256;\n  9: 0, 10, 200, 1372, 4712, 9290, 11040, 7840, 3072, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (2*n-4+(2*n-4)*x)*P(n-1,x) - (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2*x, P(2,x) = 3*x + 4*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[2, x_] := 3*x + 4*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 4 + (2*n - 4)*x)*P[n - 1, x] - (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];\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; v[3] = 3*x + 4*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((2*n - 4 + (2*n - 4)*x)*v[i - 1] - (n - 2 + (n - 2)*x)*v[i - 2])/(n - 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":"A181289","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,  2;\n  2: 0,  3,   4;\n  3: 0,  4,  12,    8;\n  4: 0,  5,  25,   36,   16;\n  5: 0,  6,  44,  102,   96,   32;\n  6: 0,  7,  70,  231,  344,  240,    64;\n  7: 0,  8, 104,  456,  952, 1040,   576,  128;\n  8: 0,  9, 147,  819, 2241, 3400,  2928, 1344,  256;\n  9: 0, 10, 200, 1372, 4712, 9290, 11040, 7840, 3072, 512;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (2*n-4+(2*n-4)*x)*P(n-1,x) - (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2*x, P(2,x) = 3*x + 4*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[2, x_] := 3*x + 4*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 4 + (2*n - 4)*x)*P[n - 1, x] - (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];\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; v[3] = 3*x + 4*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((2*n - 4 + (2*n - 4)*x)*v[i - 1] - (n - 2 + (n - 2)*x)*v[i - 2])/(n - 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}}],"derivation":{"root":"n-4ad294e2bfbb52a6","steps":[],"edges":[],"text":"A181289"},"headline":"A181289: Triangle read by rows: T(n,k) is the number of 2-compositions of n having length k (0 <= k <= n).","chain":null}