{"id":"n-be6279abbb83a349","revision":0,"first_index":0,"fingerprint":"f6-5870953131fc996b","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.","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"],["3","10","12","6","1"],["15","70","131","124","61","14","1"],["105","630","1600","2226","1830","890","240","30","1"],["945","6930","22225","40796","47062","35216","16990","5060","841","62","1"],["10395","90090","349020","795718","1182195","1196532","836976","401436","127953","25410","2772","126","1"],["135135","1351350","6136515","16716700","30393335","38808946","35643099","23698536","11315829","3789786","851361","118524","8821","254","1"],["2027025","22972950","119639520","379068690","815302180","1257343230","1431293496","1219253530","779175270","370748610","128945040","31726422","5231460","527530","27480","510","1"],["34459425","436486050","2564186625","9263714460","23007444460","41592937100","56519394316","58769110972","47141876486","29183679040","13847170470","4961577972","1309489644","244783252","30459980","2276020","84481","1022","1"],["654729075","9166207050","59959399500","243258525510","685141702245","1420743884560","2244466031808","2757034703280","2663771430782","2034187404756","1226858756376","580778482636","213176209290","59494178304","12256126432","1782403392","170761503","9613010","257532","2046","1"],["13749310575","210822762150","1519626183075","6840434781180","21543944447025","50405373488470","90778203721205","128664368953120","145492990769126","132266791903324","96944972634446","57208926323704","27029601856466","10120910020012","2956285621498","658233616832","108035533243","12440487422","931484191","40001324","780781","4094","1"],["316234143225","5270569053750","41504585522400","205271096080050","714864485585250","1862775307403010","3767157853338880","6052385552563350","7842884131297215","8275154712970236","7146149679077760","5058811491026580","2930624496437820","1382367456926820","526350391414848","159688110321740","37894557195495","6853009324590","910192002720","84117771738","4979773890","164698170","2358720","8190","1"],["7905853580625","142305364451250","1215498635175825","6551668705081500","24998687891827650","71795778656401800","161099165706849370","289350444521077940","422790909337771975","508003475817769386","505326226233266607","417610326654228696","286937085388602300","163608007264877280","77064791725498668","29764999197465896","9324667526757583","2333807207333030","457070507971935","68071469265228","7405656149346","555163162008","26223530970","672961380","7108921","16382","1"],["213458046676875","4126855569086250","38000802877537500","221714920156479750","919837385235343575","2886686822386867500","7117066562237551920","14132680980550071940","22990127538104621895","30997126009976742798","34911698252822897740","33006919483118572722","26258132579729885091","17580389889834010056","9886922776677081024","4651376676940838040","1818773615964997601","585660748031587878","153361121512741428","32109912970946954","5254617673036485","651581919184716","58632668644368","3595906127268","136522672653","2734531810","21392292","32766","1"]],"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":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-2","-1"],["2","4","2"]]},"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":189413,"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-7696025842407877"]},{"id":189414,"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-7696025842407877"]},{"id":189415,"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-7696025842407877"]}],"region_exact":{},"incoming_edges":[{"id":"e-7696025842407877","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":2}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-be6279abbb83a349","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":"90276b787fa9bb5f979d66b1694a3e88f48a9b172e07ae4ccac3c75ab5222548","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-f712c326ca8e5415","role":"sequence","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.","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-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-f712c326ca8e5415","other":{"id":"n-f712c326ca8e5415","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.","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"],["1","6","12","10","3"]],"card_rows":[["1"],["1","2","1"],["1","6","12","10","3"],["1","14","61","124","131","70","15"]],"row_sums_preview":["1","4","32","416","7552","176128","5018624","168968192"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A094262"],"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}}],"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:        1;\n  1:        1,         2,          1;\n  2:        3,        10,         12,          6,           1;\n  3:       15,        70,        131,        124,          61,          14,           1;\n  4:      105,       630,       1600,       2226,        1830,         890,         240,          30,           1;\n  5:      945,      6930,      22225,      40796,       47062,       35216,       16990,        5060,         841,          62,           1;\n  6:    10395,     90090,     349020,     795718,     1182195,     1196532,      836976,      401436,      127953,       25410,        2772,        126,          1;\n  7:   135135,   1351350,    6136515,   16716700,    30393335,    38808946,    35643099,    23698536,    11315829,     3789786,      851361,     118524,       8821,       254,        1;\n  8:  2027025,  22972950,  119639520,  379068690,   815302180,  1257343230,  1431293496,  1219253530,   779175270,   370748610,   128945040,   31726422,    5231460,    527530,    27480,     510,     1;\n  9: 34459425, 436486050, 2564186625, 9263714460, 23007444460, 41592937100, 56519394316, 58769110972, 47141876486, 29183679040, 13847170470, 4961577972, 1309489644, 244783252, 30459980, 2276020, 84481, 1022, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+(4*n-2)*x+(2*n-1)*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[(2*n - 1 + (4*n - 2)*x + (2*n - 1)*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] = (2*n - 1 + (4*n - 2)*x + (2*n - 1)*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}}],"derivation":{"root":"n-f712c326ca8e5415","steps":["reverse"],"edges":["e-7696025842407877"],"text":"A094262 \u2192 reverse"},"headline":"A094262 \u2192 reverse","chain":null}