{"id":"n-347ee1f2ae9cec52","revision":1,"first_index":0,"fingerprint":"f6-181bf1738e48841f","name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= 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":[["3"],["3","24"],["3","48","108"],["3","72","324","384"],["3","96","648","1536","1200"],["3","120","1080","3840","6000","3456"],["3","144","1620","7680","18000","20736","9408"],["3","168","2268","13440","42000","72576","65856","24576"],["3","192","3024","21504","84000","193536","263424","196608","62208"],["3","216","3888","32256","151200","435456","790272","884736","559872","153600"],["3","240","4860","46080","252000","870912","1975680","2949120","2799360","1536000","371712"],["3","264","5940","63360","396000","1596672","4346496","8110080","10264320","8448000","4088832","884736"],["3","288","7128","84480","594000","2737152","8692992","19464192","30792960","33792000","24532992","10616832","2076672"],["3","312","8424","109824","858000","4447872","16144128","42172416","80061696","109824000","106309632","69009408","26996736","4816896"],["3","336","9828","139776","1201200","6918912","28252224","84344832","186810624","307507200","372083712","322043904","188977152","67436544","11059200"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","27","159","783","3483","14499","57591","220887","824499","3011499","10805967","38204703","133391691","460759347","1576785447"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"]],"recurrence":{"denominator":{"coeffs":[["1","-2","0"],["0","6","0"],["0","0","4"]]},"terms":[{"coeff":{"coeffs":[["1","6","12","8"],["0","6","20","16"],["0","0","4","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164139,"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-edf3f02736b33ee9"]},{"id":164140,"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-edf3f02736b33ee9"]},{"id":164141,"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-edf3f02736b33ee9"]},{"id":164142,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-edf3f02736b33ee9"]}],"region_exact":{},"incoming_edges":[{"id":"e-edf3f02736b33ee9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-347ee1f2ae9cec52","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"6f733a59664a9ce86d8da0c2db18fb515c5b7896947eecd6987749145e690289","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":"unordered"}],"premises":[{"position":0,"node_id":"n-765f9e2b013b3c68","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-8f17507d399eaaea","kind":"fingerprint_related","node_a_id":"n-03f76cccc35ea4e0","node_b_id":"n-347ee1f2ae9cec52","fingerprint":"f6-181bf1738e48841f","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-181bf1738e48841f"},"other_id":"n-03f76cccc35ea4e0","other":{"id":"n-03f76cccc35ea4e0","name":"theta_plus_one_squared of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-181bf1738e48841f","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","8"],["1","16","36"]],"card_rows":[["1"],["1","8"],["1","16","36"],["1","24","108","128"]],"row_sums_preview":["1","9","53","261","1161","4833","19197","73629"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["(\u03b8+1)\u00b2"],"edges":["e-cb6823c49bab7cdf"],"text":"A013609 \u2192 (\u03b8+1)\u00b2"},"headline":"A013609 \u2192 (\u03b8+1)\u00b2","chain":null}}],"oeis":[],"bfiles":[],"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: 3;\n  1: 3,  24;\n  2: 3,  48,  108;\n  3: 3,  72,  324,   384;\n  4: 3,  96,  648,  1536,   1200;\n  5: 3, 120, 1080,  3840,   6000,   3456;\n  6: 3, 144, 1620,  7680,  18000,  20736,   9408;\n  7: 3, 168, 2268, 13440,  42000,  72576,  65856,  24576;\n  8: 3, 192, 3024, 21504,  84000, 193536, 263424, 196608,  62208;\n  9: 3, 216, 3888, 32256, 151200, 435456, 790272, 884736, 559872, 153600;\n","recurrence_sentence":"The row polynomials satisfy (1+(6*n-2)*x+4*n^2*x^2)*P(n,x) = (1+(6*n+6)*x+(4*n^2+20*n+12)*x^2+(8*n^2+16*n+8)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 3.","mathematica":"P[0, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[Together[((1 + (6*n + 6)*x + (4*n^2 + 20*n + 12)*x^2 + (8*n^2 + 16*n + 8)*x^3)*P[n - 1, x])/(1 + (6*n - 2)*x + 4*n^2*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((1 + (6*n + 6)*x + (4*n^2 + 20*n + 12)*x^2 + (8*n^2 + 16*n + 8)*x^3)*v[i - 1])/(1 + (6*n - 2)*x + 4*n^2*x^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}}],"derivation":{"root":"n-765f9e2b013b3c68","steps":["(\u03b8+1)\u00b2"],"edges":["e-edf3f02736b33ee9"],"text":"A120909 \u2192 (\u03b8+1)\u00b2"},"headline":"A120909 \u2192 (\u03b8+1)\u00b2","chain":null}