{"id":"n-dc8f9b0d78276a3e","revision":0,"first_index":0,"fingerprint":"f6-e4c9f9bbfb759620","name":"basis_map_A013610 of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","3"],["5","15","9"],["14","63","81","27"],["41","246","495","378","81"],["122","915","2520","3105","1620","243"],["365","3285","11502","19737","17010","6561","729"],["1094","11487","48825","107730","130977","85050","25515","2187"],["3281","39372","196866","531576","838107","775656","398034","96228","6561"],["9842","132867","763992","2441502","4739958","5727753","4225284","1771470","354294","19683"],["29525","442875","2878695","10629090","24538545","36696645","35549685","21585690","7577955","1279395","59049"],["88574","1461471","10595673","44392293","118859400","212201451","255493359","204749127","104792292","31394385","4546773","177147"],["265721","4782978","38263833","179361810","546605658","1135363554","1637416377","1636982622","1110711690","488020302","126660105","15943230","531441"],["797162","15544659","136015776","705339063","2411123598","5715218574","9615819096","11548928079","9808183242","5736295422","2195441820","499731687","55269864","1594323"],["2391485","50221185","477101268","2711944179","10278081009","27387818010","52704615789","74024659647","75724575381","55600971426","28430971569","9591624315","1934445240","189724437","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","29","185","1241","8525","59189","412865","2885681","20186645","141267149","988751945","6920909321","48445302365","339113927909"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-9","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201843,"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-f955fdd3a815ec3d"]},{"id":201844,"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-f955fdd3a815ec3d"]},{"id":201845,"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-f955fdd3a815ec3d"]},{"id":201846,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-f955fdd3a815ec3d"]}],"region_exact":{},"incoming_edges":[{"id":"e-f955fdd3a815ec3d","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-dc8f9b0d78276a3e","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"c23b690e893cc200e67e938c79195ac12a342a2ec266e3aee9110bb6d7f20ce0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-a6f3b35778192ffb","role":"sequence","name":"Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).","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":[],"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:    2,      3;\n  2:    5,     15,      9;\n  3:   14,     63,     81,      27;\n  4:   41,    246,    495,     378,      81;\n  5:  122,    915,   2520,    3105,    1620,     243;\n  6:  365,   3285,  11502,   19737,   17010,    6561,     729;\n  7: 1094,  11487,  48825,  107730,  130977,   85050,   25515,    2187;\n  8: 3281,  39372, 196866,  531576,  838107,  775656,  398034,   96228,   6561;\n  9: 9842, 132867, 763992, 2441502, 4739958, 5727753, 4225284, 1771470, 354294, 19683;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(3+9*x+9*x^2)*P(n-2,x) + (4+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 3*x;\nP[n_, x_] := P[n, x] = Expand[-(3 + 9*x + 9*x^2)*P[n - 2, x] + (4 + 6*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 9*x + 9*x^2)*v[i - 2] + (4 + 6*x)*v[i - 1]); 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-a6f3b35778192ffb","steps":["basis A013610"],"edges":["e-f955fdd3a815ec3d"],"text":"A056241 \u2192 basis A013610"},"headline":"A056241 \u2192 basis A013610","chain":null}