{"id":"n-f1291d4c6c67167e","revision":0,"first_index":0,"fingerprint":"f6-fdab596c99811270","name":"Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors.","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"],["1","2"],["1","4","3"],["1","6","6"],["1","10","21","12"],["1","14","36","24"],["1","22","93","132","60"],["1","30","150","240","120"],["1","46","345","900","960","360"],["1","62","540","1560","1800","720"],["1","94","1173","4980","9300","7920","2520"],["1","126","1806","8400","16800","15120","5040"],["1","190","3801","24612","71400","103320","73080","20160"],["1","254","5796","40824","126000","191520","141120","40320"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","2","3","8","13","44","75","308","541","2612","4683","25988","47293","296564","545835"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A305540","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":1,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170042,"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-7a25d69a347b08f4"]},{"id":170043,"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-7a25d69a347b08f4"]},{"id":170044,"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-7a25d69a347b08f4"]}],"region_exact":{},"incoming_edges":[{"id":"e-7a25d69a347b08f4","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-f1291d4c6c67167e","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; S_n = A + B D + C D^2 with A = 1 + 2 x, B = x + x^2, C = 0: Branden's Weyl step: T = A + B D + C D^2 maps every real-rooted polynomial to a real-rooted polynomial when (i) B^2 - 4 A C >= 0 on the real line, (ii) A strictly interlaces B (deg B = deg A + 1) or strictly alternates left of B (deg B = deg A), with leading coefficients of the same sign when deg A >= 1, and (iii) T(x^k) has degree deg A + k with leading coefficients of one sign for every k >= 0 (P. Branden, Linear transformations preserving the Polya frequency property, Trans. Amer. Math. Soc. 358 (2006), Corollary 3.5); (i) is necessary for a real-rootedness preserver (J. Borcea and P. Branden, Proc. London Math. Soc. 101 (2010), Theorem 1.3); with coefficients of one sign T also keeps every root in (-inf, 0]; with lag L = 2, the induction runs in each residue class of n modulo L from its start row","lean_route":null,"lean_declarations":[],"certificate_hash":"69ad0a8f1c7ba83287a5df1d3cf640143c662f333ab65b8bd99c8ac2b7ff1011","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[{"id":"e-2f78ee142f184ee3","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-54d7b058e1600620","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors."},{"id":"e-349195f4370370d8","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-50db7487a36f0f5e","conclusion_name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors."},{"id":"e-74d6069d43e2ae36","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-7ee6c371ec3eafc5","conclusion_name":"derivative of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors."},{"id":"e-9fefe7a8a7b886ef","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-79838d1a829232ee","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors."},{"id":"e-a489be38a6c900af","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-4a145153652b996f","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors."}],"used_by_total":5,"links":[{"id":"l-1b9fe2b392d2866d","kind":"oeis_match","node_a_id":"n-f1291d4c6c67167e","node_b_id":null,"fingerprint":null,"oeis_id":"A327868","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":"A327868","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-4ed443142e4340ba","kind":"oeis_match","node_a_id":"n-f1291d4c6c67167e","node_b_id":null,"fingerprint":null,"oeis_id":"A305540","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":15,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":15,"target":"triangle","terms_compared":71},"in_catalog":true,"oeis_id":"A305540","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A305540","relation":"identification"},{"oeis_id":"A327868","relation":"match_row_sums"},{"oeis_id":"A305540","relation":"match_triangle"}],"bfiles":[{"node_id":"n-f1291d4c6c67167e","oeis_id":"A305540","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":61,"terms_matched":71,"oeis_terms_agreeing":71,"oeis_terms_available":71,"term_count":991,"raw_size":23513}],"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,  2;\n  3: 1,  4,   3;\n  4: 1,  6,   6;\n  5: 1, 10,  21,  12;\n  6: 1, 14,  36,  24;\n  7: 1, 22,  93, 132,  60;\n  8: 1, 30, 150, 240, 120;\n  9: 1, 46, 345, 900, 960, 360;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*x)*P(n-2,x) + (x+x^2)*d/dx 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 + 2*x)*P[n - 2, x] + (x + x^2)*D[P[n - 2, x], 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 + 2*x)*v[i - 2] + (x + x^2)*deriv(v[i - 2], x)); 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":"A305540","target":"triangle","first_row":0,"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,  1;\n   3: 1,  2;\n   4: 1,  4,   3;\n   5: 1,  6,   6;\n   6: 1, 10,  21,  12;\n   7: 1, 14,  36,  24;\n   8: 1, 22,  93, 132,  60;\n   9: 1, 30, 150, 240, 120;\n  10: 1, 46, 345, 900, 960, 360;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*x)*P(n-2,x) + (x+x^2)*d/dx P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[(1 + 2*x)*P[n - 2, x] + (x + x^2)*D[P[n - 2, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + x; for(n = 3, N, my(i = n); v[i] = (1 + 2*x)*v[i - 2] + (x + x^2)*deriv(v[i - 2], x)); 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":0,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-f1291d4c6c67167e","steps":[],"edges":[],"text":"A305540"},"headline":"A305540: Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors.","chain":null}