{"id":"n-6a79351bf6797e1b","revision":1,"first_index":1,"fingerprint":"f6-25d8aa315370fa03","name":"veronese_section_2_0 of Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","5"],["1","35"],["1","126","9"],["1","330","165"],["1","715","1287","13"],["1","1365","6435","455"],["1","2380","24310","6188","17"],["1","3876","75582","50388","969"],["1","5985","203490","293930","20349","21"],["1","8855","490314","1352078","245157","1771"],["1","12650","1081575","5200300","2042975","53130","25"],["1","17550","2220075","17383860","13037895","888030","2925"],["1","23751","4292145","51895935","67863915","10015005","118755","29"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","6","36","136","496","2016","8256","32896","130816","523776","2098176","8390656","33550336","134209536"],"nonn":true,"definitions":[{"position":0,"source":"derived:veronese_section_2_0","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"],["1","5"],["1","35"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","12","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168553,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-d03002d6b7efed5a"]},{"id":168554,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-d03002d6b7efed5a"]},{"id":168555,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-d03002d6b7efed5a"]},{"id":168556,"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-d03002d6b7efed5a"]}],"region_exact":{},"incoming_edges":[{"id":"e-d03002d6b7efed5a","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":0},"operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-6a79351bf6797e1b","premise_count":1,"theorem":"Veronese sections of Polya frequency sequences (Aissen--Schoenberg--Whitney--Edrei): if P is real-rooted with coefficients of one sign, equivalently nonzero with all roots in (-inf, 0], every section V_(r,j)(P) is zero or real-rooted with roots in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"8ba194c09183f4cff5414938a125c1cdb0f4a362a75c86044f4a230a7e07ef9c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[{"position":0,"node_id":"n-ba8de4e02acfb6ca","role":"sequence","name":"Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-70b84e3fc7c95332","kind":"oeis_match","node_a_id":"n-6a79351bf6797e1b","node_b_id":null,"fingerprint":null,"oeis_id":"A387869","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":15},"in_catalog":false,"oeis_id":"A387869","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A387869","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-6a79351bf6797e1b","oeis_id":"A387869","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":12911}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1;\n   2: 1;\n   3: 1,    5;\n   4: 1,   35;\n   5: 1,  126,     9;\n   6: 1,  330,   165;\n   7: 1,  715,  1287,    13;\n   8: 1, 1365,  6435,   455;\n   9: 1, 2380, 24310,  6188,  17;\n  10: 1, 3876, 75582, 50388, 969;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 4*P(n-1,x) - (6-2*x)*P(n-2,x) + (4+12*x)*P(n-3,x) - (1-2*x+x^2)*P(n-4,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1, P(3,x) = 1 + 5*x, P(4,x) = 1 + 35*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[3, x_] := 1 + 5*x;\nP[4, x_] := 1 + 35*x;\nP[n_, x_] := P[n, x] = Expand[4*P[n - 1, x] - (6 - 2*x)*P[n - 2, x] + (4 + 12*x)*P[n - 3, x] - (1 - 2*x + x^2)*P[n - 4, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; v[3] = 1 + 5*x; v[4] = 1 + 35*x; for(n = 5, N, my(i = n); v[i] = 4*v[i - 1] - (6 - 2*x)*v[i - 2] + (4 + 12*x)*v[i - 3] - (1 - 2*x + x^2)*v[i - 4]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-ba8de4e02acfb6ca","steps":["Veronese 2"],"edges":["e-d03002d6b7efed5a"],"text":"A091042 \u2192 Veronese 2"},"headline":"A091042 \u2192 Veronese 2","chain":null}