{"id":"n-be6df4e2aaa08cb9","revision":0,"first_index":1,"fingerprint":"f6-de3a1cd8e58b208d","name":"reversal of Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k^2*T(n-1, k), for 0 <= k <= n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","1"],["1","5","1"],["1","14","21","1"],["1","30","147","85","1"],["1","55","627","1408","341","1"],["1","91","2002","11440","13013","1365","1"],["1","140","5278","61490","196053","118482","5461","1"],["1","204","12138","251498","1733303","3255330","1071799","21845","1"],["1","285","25194","846260","10787231","46587905","53157079","9668036","87381","1"],["1","385","48279","2458676","52253971","434928221","1217854704","860181300","87099705","349525","1"],["1","506","86779","6369275","209609235","2995372800","16875270660","31306548900","13850000505","784246870","1398101","1"],["1","650","148005","15047175","725520510","16410363840","163648537860","638816292660","796513723005","222384254950","7059619931","5592405","1"],["1","819","241605","32955780","2230238010","75177525150","1213911823620","8657594647800","23793900258765","20135227330075","3565207699131","63542171784","22369621","1"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","2","7","37","264","2433","27913","386906","6346119","121159373","2655174768","66028903633","1845579100993","57506847262162"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"],["0","-4"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","5"],["0","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","1"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178383,"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-1a2e832c44bd88a2"]},{"id":178384,"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-1a2e832c44bd88a2"]},{"id":178385,"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-1a2e832c44bd88a2"]}],"region_exact":{},"incoming_edges":[{"id":"e-1a2e832c44bd88a2","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-be6df4e2aaa08cb9","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":"daccdf4da9cd26f8ac75f7a1d85267e62fd76dab6edf11f030c074321681812d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-0164479e47952770","role":"sequence","name":"Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k^2*T(n-1, k), for 0 <= k <= n.","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-0447c4f0c9343da1","kind":"fingerprint_related","node_a_id":"n-c23f36ab5968876b","node_b_id":"n-be6df4e2aaa08cb9","fingerprint":"f6-de3a1cd8e58b208d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-de3a1cd8e58b208d"},"other_id":"n-c23f36ab5968876b","other":{"id":"n-c23f36ab5968876b","name":"Triangle of central factorial numbers T(2*n,2*n-2*k), k >= 0, n >= 1 (in Riordan's notation).","first_index":0,"fingerprint":"f6-de3a1cd8e58b208d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","5","1"]],"card_rows":[["1"],["1","1"],["1","5","1"],["1","14","21","1"]],"row_sums_preview":["1","2","7","37","264","2433","27913","386906"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A008957"],"derivation":{"root":"n-c23f36ab5968876b","steps":[],"edges":[],"text":"A008957"},"headline":"A008957: Triangle of central factorial numbers T(2*n,2*n-2*k), k >= 0, n >= 1 (in Riordan's notation).","chain":null}},{"id":"l-7741bfccd9626e33","kind":"fingerprint_related","node_a_id":"n-0164479e47952770","node_b_id":"n-be6df4e2aaa08cb9","fingerprint":"f6-de3a1cd8e58b208d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-de3a1cd8e58b208d"},"other_id":"n-0164479e47952770","other":{"id":"n-0164479e47952770","name":"Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k^2*T(n-1, k), for 0 <= k <= n.","first_index":1,"fingerprint":"f6-de3a1cd8e58b208d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","1","5","1"]],"row_sums_preview":["1","1","2","7","37","264","2433","27913"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A269945"],"derivation":{"root":"n-0164479e47952770","steps":[],"edges":[],"text":"A269945"},"headline":"A269945: Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k^2*T(n-1, k), for 0 <= k <= n.","chain":null}},{"id":"l-e13f299fbc8c790c","kind":"fingerprint_related","node_a_id":"n-c856ca922af03076","node_b_id":"n-be6df4e2aaa08cb9","fingerprint":"f6-de3a1cd8e58b208d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-de3a1cd8e58b208d"},"other_id":"n-c856ca922af03076","other":{"id":"n-c856ca922af03076","name":"Triangle read by rows: T(n,k) = T(n-1,k-1) + k^2*T(n-1,k), 1 < k <= n, T(n,1) = 1.","first_index":0,"fingerprint":"f6-de3a1cd8e58b208d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","5","1"]],"card_rows":[["1"],["1","1"],["1","5","1"],["1","21","14","1"]],"row_sums_preview":["1","2","7","37","264","2433","27913","386906"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A036969"],"derivation":{"root":"n-c856ca922af03076","steps":[],"edges":[],"text":"A036969"},"headline":"A036969: Triangle read by rows: T(n,k) = T(n-1,k-1) + k^2*T(n-1,k), 1 < k <= n, T(n,1) = 1.","chain":null}}],"oeis":[],"bfiles":[],"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,   1;\n   4: 1,   5,     1;\n   5: 1,  14,    21,      1;\n   6: 1,  30,   147,     85,       1;\n   7: 1,  55,   627,   1408,     341,       1;\n   8: 1,  91,  2002,  11440,   13013,    1365,       1;\n   9: 1, 140,  5278,  61490,  196053,  118482,    5461,     1;\n  10: 1, 204, 12138, 251498, 1733303, 3255330, 1071799, 21845, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(n^2-4*n+4)*x)*P(n-1,x) - (2*n-5)*x^2*d/dx P(n-1,x) + x^3*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + (n^2 - 4*n + 4)*x)*P[n - 1, x] - (2*n - 5)*x^2*D[P[n - 1, x], x] + x^3*D[P[n - 1, x], {x, 2}]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (n^2 - 4*n + 4)*x)*v[i - 1] - (2*n - 5)*x^2*deriv(v[i - 1], x) + x^3*deriv(deriv(v[i - 1], x), 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":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-0164479e47952770","steps":["reverse"],"edges":["e-1a2e832c44bd88a2"],"text":"A269945 \u2192 reverse"},"headline":"A269945 \u2192 reverse","chain":null}