{"id":"n-3ab85f10ab048936","revision":1,"first_index":0,"fingerprint":"f6-7b110b9bf1f12827","name":"obreschkoff_combination of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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":true,"rows":[["2","1"],["3","4","1"],["8","14","7","1"],["30","61","41","11","1"],["144","324","260","95","16","1"],["840","2038","1849","820","190","22","1"],["5760","14832","14756","7504","2135","343","29","1"],["45360","122652","131256","74053","24409","4858","574","37","1"],["403200","1136160","1290824","790964","291774","67809","9996","906","46","1"],["3991680","11655216","13926276","9133180","3686255","965328","167223","19020","1365","56","1"],["43545600","131172480","163671552","113667576","49412660","14241590","2795331","375573","33990","1980","67","1"],["518918400","1606986720","2082477528","1519272964","703202566","219409685","47627789","7284057","782133","57695","2783","79","1"],["6706022400","21289201920","28528276608","21727767984","10614910592","3542188936","835933384","141963107","17419116","1530243","93808","3809","92","1"],["93405312000","303268406400","418753514880","331303013496","169679309436","59999485546","15200266081","2816490248","385081268","38786748","2840838","147056","5096","106","1"],["1394852659200","4622628648960","6557974412544","5367984964224","2866534951280","1066335473840","287212533608","57312583328","8576039615","965408015","81308227","5042947","223405","6685","121","1"]],"degrees":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"row_sums":["3","8","30","144","840","5760","45360","403200","3991680","43545600","518918400","6706022400","93405312000","1394852659200","22230464256000"],"nonn":true,"definitions":[{"position":0,"source":"derived:obreschkoff_combination","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["2","1"]],"recurrence":{"denominator":{"coeffs":[["1","1"],["1","0"]]},"terms":[{"coeff":{"coeffs":[["0","2","1"],["2","2","0"],["1","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":162742,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-d13f851235c1b0bb"]}],"region_exact":{},"incoming_edges":[{"id":"e-d13f851235c1b0bb","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-3ab85f10ab048936","premise_count":2,"theorem":"Hermite--Kakeya--Obreschkoff: real-rooted f, g with interlacing zeros give a zero or real-rooted a f + b g for all real a, b (Obreschkoff 1963; Fisk, Polynomials, roots, and interlacing, Thm 1.43)","lean_route":null,"lean_declarations":[],"certificate_hash":"ce162e3cc0e7fe439354d5d770d302036f662749025c50bdb0bac8a520596738","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-efe23a76953cf69d","role":"sequence","name":"Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","uses":{"claim":"real_rooted","from_index":0,"region":{}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)"},{"position":1,"node_id":"n-efe23a76953cf69d","role":"sequence","name":"Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","uses":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"uses_text":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-06e1c46d9bd7043b","kind":"oeis_match","node_a_id":"n-3ab85f10ab048936","node_b_id":null,"fingerprint":null,"oeis_id":"A001048","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":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001048","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-0ae86f3dd14ee77e","kind":"oeis_match","node_a_id":"n-3ab85f10ab048936","node_b_id":null,"fingerprint":null,"oeis_id":"A261766","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":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A261766","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-66c4a23278c380e6","kind":"oeis_match","node_a_id":"n-3ab85f10ab048936","node_b_id":null,"fingerprint":null,"oeis_id":"A059171","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":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A059171","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A001048","relation":"match_row_sums"},{"oeis_id":"A059171","relation":"match_row_sums"},{"oeis_id":"A261766","relation":"match_row_sums"}],"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:       2,        1;\n  1:       3,        4,        1;\n  2:       8,       14,        7,       1;\n  3:      30,       61,       41,      11,       1;\n  4:     144,      324,      260,      95,      16,      1;\n  5:     840,     2038,     1849,     820,     190,     22,      1;\n  6:    5760,    14832,    14756,    7504,    2135,    343,     29,     1;\n  7:   45360,   122652,   131256,   74053,   24409,   4858,    574,    37,    1;\n  8:  403200,  1136160,  1290824,  790964,  291774,  67809,   9996,   906,   46,  1;\n  9: 3991680, 11655216, 13926276, 9133180, 3686255, 965328, 167223, 19020, 1365, 56, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1+x)*P(n,x) = (n^2+2*n+(2*n+2)*x+x^2)*P(n-1,x) for n >= 1, with P(0,x) = 2 + x.","mathematica":"P[0, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((n^2 + 2*n + (2*n + 2)*x + x^2)*P[n - 1, x])/(n + 1 + x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 2 + x; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + 2*n + (2*n + 2)*x + x^2)*v[i - 1])/(n + 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-efe23a76953cf69d","steps":["P\u2099 + P\u2099\u208a\u2081"],"edges":["e-d13f851235c1b0bb"],"text":"A130534 \u2192 P\u2099 + P\u2099\u208a\u2081"},"headline":"A130534 \u2192 P\u2099 + P\u2099\u208a\u2081","chain":null}