{"id":"n-f712c326ca8e5415","revision":0,"first_index":0,"fingerprint":"f6-5870953131fc996b","name":"Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":2,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","2","1"],["1","6","12","10","3"],["1","14","61","124","131","70","15"],["1","30","240","890","1830","2226","1600","630","105"],["1","62","841","5060","16990","35216","47062","40796","22225","6930","945"],["1","126","2772","25410","127953","401436","836976","1196532","1182195","795718","349020","90090","10395"],["1","254","8821","118524","851361","3789786","11315829","23698536","35643099","38808946","30393335","16716700","6136515","1351350","135135"],["1","510","27480","527530","5231460","31726422","128945040","370748610","779175270","1219253530","1431293496","1257343230","815302180","379068690","119639520","22972950","2027025"],["1","1022","84481","2276020","30459980","244783252","1309489644","4961577972","13847170470","29183679040","47141876486","58769110972","56519394316","41592937100","23007444460","9263714460","2564186625","436486050","34459425"],["1","2046","257532","9613010","170761503","1782403392","12256126432","59494178304","213176209290","580778482636","1226858756376","2034187404756","2663771430782","2757034703280","2244466031808","1420743884560","685141702245","243258525510","59959399500","9166207050","654729075"],["1","4094","780781","40001324","931484191","12440487422","108035533243","658233616832","2956285621498","10120910020012","27029601856466","57208926323704","96944972634446","132266791903324","145492990769126","128664368953120","90778203721205","50405373488470","21543944447025","6840434781180","1519626183075","210822762150","13749310575"],["1","8190","2358720","164698170","4979773890","84117771738","910192002720","6853009324590","37894557195495","159688110321740","526350391414848","1382367456926820","2930624496437820","5058811491026580","7146149679077760","8275154712970236","7842884131297215","6052385552563350","3767157853338880","1862775307403010","714864485585250","205271096080050","41504585522400","5270569053750","316234143225"],["1","16382","7108921","672961380","26223530970","555163162008","7405656149346","68071469265228","457070507971935","2333807207333030","9324667526757583","29764999197465896","77064791725498668","163608007264877280","286937085388602300","417610326654228696","505326226233266607","508003475817769386","422790909337771975","289350444521077940","161099165706849370","71795778656401800","24998687891827650","6551668705081500","1215498635175825","142305364451250","7905853580625"],["1","32766","21392292","2734531810","136522672653","3595906127268","58632668644368","651581919184716","5254617673036485","32109912970946954","153361121512741428","585660748031587878","1818773615964997601","4651376676940838040","9886922776677081024","17580389889834010056","26258132579729885091","33006919483118572722","34911698252822897740","30997126009976742798","22990127538104621895","14132680980550071940","7117066562237551920","2886686822386867500","919837385235343575","221714920156479750","38000802877537500","4126855569086250","213458046676875"]],"degrees":[0,2,4,6,8,10,12,14,16,18,20,22,24,26,28],"row_sums":["1","4","32","416","7552","176128","5018624","168968192","6563282944","288909131776","14212910809088","772776684683264","46017323176296448","2978458881388183552","208198894960190160896"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A094262","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","2","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169257,"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-87f5195a0aea3826"]},{"id":169258,"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-87f5195a0aea3826"]},{"id":169259,"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-87f5195a0aea3826"]}],"region_exact":{},"incoming_edges":[{"id":"e-87f5195a0aea3826","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-f712c326ca8e5415","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 = f(n, theta) = 1 + (1) theta: 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":"913970a1fa27eafcbcc08968cb38502c2a24b4a5c639ec020cc572020b8772ff","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-2263ada65e6ad839","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-5a364d1118d1dc6e","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-6c9a4759e3e35b35","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-49a8d5132607d3b9","conclusion_name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-7696025842407877","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-be6279abbb83a349","conclusion_name":"reversal of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-a473098a8e206989","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-4b763390b67311c8","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-b04a126cf24a2c71","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-3d2f72d29c0e6cb2","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-f3dd50fc95d394a1","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-3a888a6c3242a89e","conclusion_name":"derivative of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."},{"id":"e-f8ab0a053d6763c2","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-56cb29b4e81fea25","conclusion_name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children."}],"used_by_total":7,"links":[{"id":"l-b6a8a17493d09787","kind":"fingerprint_related","node_a_id":"n-f712c326ca8e5415","node_b_id":"n-be6279abbb83a349","fingerprint":"f6-5870953131fc996b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5870953131fc996b"},"other_id":"n-be6279abbb83a349","other":{"id":"n-be6279abbb83a349","name":"reversal of Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.","first_index":0,"fingerprint":"f6-5870953131fc996b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2","1"],["3","10","12","6","1"]],"card_rows":[["1"],["1","2","1"],["3","10","12","6","1"],["15","70","131","124","61","14","1"]],"row_sums_preview":["1","4","32","416","7552","176128","5018624","168968192"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-f712c326ca8e5415","steps":["reverse"],"edges":["e-7696025842407877"],"text":"A094262 \u2192 reverse"},"headline":"A094262 \u2192 reverse","chain":null}},{"id":"l-1f5e363ca9e2921b","kind":"oeis_match","node_a_id":"n-f712c326ca8e5415","node_b_id":null,"fingerprint":null,"oeis_id":"A005172","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":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A005172","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-8dc6559f1ec22917","kind":"oeis_match","node_a_id":"n-f712c326ca8e5415","node_b_id":null,"fingerprint":null,"oeis_id":"A094262","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":7,"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":7,"target":"triangle","terms_compared":49},"in_catalog":true,"oeis_id":"A094262","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-be1c5394a3fb8c68","kind":"oeis_match","node_a_id":"n-f712c326ca8e5415","node_b_id":null,"fingerprint":null,"oeis_id":"A225170","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":1,"oeis_term_position":1,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A225170","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A094262","relation":"identification"},{"oeis_id":"A005172","relation":"match_row_sums"},{"oeis_id":"A225170","relation":"match_row_sums"},{"oeis_id":"A094262","relation":"match_triangle"}],"bfiles":[{"node_id":"n-f712c326ca8e5415","oeis_id":"A005172","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":19,"oeis_terms_available":19,"term_count":200,"raw_size":48075},{"node_id":"n-f712c326ca8e5415","oeis_id":"A094262","target":"triangle","oeis_offset":1,"first_row":0,"rows_used":32,"terms_matched":49,"oeis_terms_agreeing":49,"oeis_terms_available":49,"term_count":1024,"raw_size":33632}],"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,    2,     1;\n  2: 1,    6,    12,      10,        3;\n  3: 1,   14,    61,     124,      131,        70,         15;\n  4: 1,   30,   240,     890,     1830,      2226,       1600,        630,         105;\n  5: 1,   62,   841,    5060,    16990,     35216,      47062,      40796,       22225,        6930,         945;\n  6: 1,  126,  2772,   25410,   127953,    401436,     836976,    1196532,     1182195,      795718,      349020,       90090,       10395;\n  7: 1,  254,  8821,  118524,   851361,   3789786,   11315829,   23698536,    35643099,    38808946,    30393335,    16716700,     6136515,     1351350,      135135;\n  8: 1,  510, 27480,  527530,  5231460,  31726422,  128945040,  370748610,   779175270,  1219253530,  1431293496,  1257343230,   815302180,   379068690,   119639520,   22972950,    2027025;\n  9: 1, 1022, 84481, 2276020, 30459980, 244783252, 1309489644, 4961577972, 13847170470, 29183679040, 47141876486, 58769110972, 56519394316, 41592937100, 23007444460, 9263714460, 2564186625, 436486050, 34459425;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*x+x^2)*P(n-1,x) + (x+2*x^2+x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + 2*x + x^2)*P[n - 1, x] + (x + 2*x^2 + x^3)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (1 + 2*x + x^2)*v[i - 1] + (x + 2*x^2 + x^3)*deriv(v[i - 1], 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":"A094262","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,    2,     1;\n   3: 1,    6,    12,      10,        3;\n   4: 1,   14,    61,     124,      131,        70,         15;\n   5: 1,   30,   240,     890,     1830,      2226,       1600,        630,         105;\n   6: 1,   62,   841,    5060,    16990,     35216,      47062,      40796,       22225,        6930,         945;\n   7: 1,  126,  2772,   25410,   127953,    401436,     836976,    1196532,     1182195,      795718,      349020,       90090,       10395;\n   8: 1,  254,  8821,  118524,   851361,   3789786,   11315829,   23698536,    35643099,    38808946,    30393335,    16716700,     6136515,     1351350,      135135;\n   9: 1,  510, 27480,  527530,  5231460,  31726422,  128945040,  370748610,   779175270,  1219253530,  1431293496,  1257343230,   815302180,   379068690,   119639520,   22972950,    2027025;\n  10: 1, 1022, 84481, 2276020, 30459980, 244783252, 1309489644, 4961577972, 13847170470, 29183679040, 47141876486, 58769110972, 56519394316, 41592937100, 23007444460, 9263714460, 2564186625, 436486050, 34459425;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+2*x+x^2)*P(n-1,x) + (x+2*x^2+x^3)*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[(1 + 2*x + x^2)*P[n - 1, x] + (x + 2*x^2 + x^3)*D[P[n - 1, x], 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] = (1 + 2*x + x^2)*v[i - 1] + (x + 2*x^2 + x^3)*deriv(v[i - 1], 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-f712c326ca8e5415","steps":[],"edges":[],"text":"A094262"},"headline":"A094262: Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.","chain":null}