{"id":"n-2e7006cec065c803","revision":0,"first_index":1,"fingerprint":"f6-428eb0e1ac93bf64","name":"one_plus_derivative of Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","1"],["16","10","1"],["120","108","21","1"],["1152","1344","384","36","1"],["13440","19200","7200","1000","55","1"],["184320","311040","144000","26400","2160","78","1"],["2903040","5644800","3104640","705600","76440","4116","105","1"],["51609600","113541120","72253440","19568640","2634240","188160","7168","136","1"],["1021870080","2508226560","1811496960","568995840","91445760","8128512","411264","11664","171","1"],["22295347200","60383232000","48771072000","17418240000","3251404800","345461760","21772800","820800","18000","210","1"],["531372441600","1573679923200","1405071360000","562028544000","119431065600","14753249280","1112348160","52272000","1524600","26620","253","1"],["13733933875200","44144787456000","43163792179200","19108970496000","4552431206400","640712540160","56202854400","3161410560","114998400","2671680","38016","300","1"],["382588157952000","1326305614233600","1409199715123200","683876332339200","180467365478400","28494847180800","2849484718080","186573404160","8127250560","235572480","4461600","52728","351","1"],["11426632984166400","42492791409868800","48741731323084800","25724802642739200","7446653396582400","1303164344401920","146273548861440","10923024752640","554066472960","19238419200","454726272","7154784","71344","406","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","27","250","2917","40896","667999","12438742","259802505","6010586812","152487369571","4207502755314","125404109726317","4013976457767160","137293546441302567"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","-1"],["1","0"]]},"terms":[{"coeff":{"coeffs":[["-2","1","-1"],["0","-1","0"],["2","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-2"],["0","2","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185799,"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-b2ef929d973f3619"]},{"id":185800,"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-b2ef929d973f3619"]},{"id":185801,"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-b2ef929d973f3619"]}],"region_exact":{},"incoming_edges":[{"id":"e-b2ef929d973f3619","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-2e7006cec065c803","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"628197b1910c09819b8efe6048d73f835f486dba6dc9281406062308b1618f20","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-24ab55cfc575f41e","role":"sequence","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","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":[],"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:          3,          1;\n   3:         16,         10,          1;\n   4:        120,        108,         21,         1;\n   5:       1152,       1344,        384,        36,        1;\n   6:      13440,      19200,       7200,      1000,       55,       1;\n   7:     184320,     311040,     144000,     26400,     2160,      78,      1;\n   8:    2903040,    5644800,    3104640,    705600,    76440,    4116,    105,     1;\n   9:   51609600,  113541120,   72253440,  19568640,  2634240,  188160,   7168,   136,   1;\n  10: 1021870080, 2508226560, 1811496960, 568995840, 91445760, 8128512, 411264, 11664, 171, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-x)*P(n,x) = (2*n^2-2-(n-1)*x-x^2)*P(n-1,x) + ((2*n-2)*x-2*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n^2 - 2 - (n - 1)*x - x^2)*P[n - 1, x] + ((2*n - 2)*x - 2*x^2)*D[P[n - 1, x], x])/(n - x)]];\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] = ((2*n^2 - 2 - (n - 1)*x - x^2)*v[i - 1] + ((2*n - 2)*x - 2*x^2)*deriv(v[i - 1], x))/(n - 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-24ab55cfc575f41e","steps":["D+1"],"edges":["e-b2ef929d973f3619"],"text":"A286724 \u2192 D+1"},"headline":"A286724 \u2192 D+1","chain":null}