{"id":"n-3c85c2a2c3ff061d","revision":1,"first_index":0,"fingerprint":"f6-beba9ed1d4d6e664","name":"Triangle read by rows: T(n,m) (0<=m<=n) = number of positive n-digit numbers that have exactly m copies of a specific, previously selected positive base-10 digit among its digits.","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":true,"rows":[["1"],["8","1"],["72","17","1"],["648","225","26","1"],["5832","2673","459","35","1"],["52488","29889","6804","774","44","1"],["472392","321489","91125","13770","1170","53","1"],["4251528","3365793","1141614","215055","24300","1647","62","1"],["38263752","34543665","13640319","3077109","433755","39123","2205","71","1"],["344373768","349156737","157306536","41334300","6980904","785862","58968","2844","80","1"],["3099363912","3486784401","1764915561","529315236","104162436","14053662","1316574","84564","3564","89","1"],["27894275208","34480423521","19371024450","6528752685","1466777160","230645394","25902828","2077650","116640","4365","98","1"],["251048476872","338218086897","208819643571","78129798615","19729747125","3542585706","463770846","44601678","3127410","155925","5247","107","1"],["2259436291848","3295011258945","2217594879036","911987831106","255697522740","51613018479","7716523320","865185948","72748368","4530735","203148","6210","116","1"],["20334926626632","31914537622353","23253365170269","10425485358990","3213265535766","720214689051","121061728359","15503196852","1519921260","113524983","6359067","259038","7254","125","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","90","900","9000","90000","900000","9000000","90000000","900000000","9000000000","90000000000","900000000000","9000000000000","90000000000000"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A380860","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["8","1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-9","-1"],["9","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169843,"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":false,"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-70624c7ff3bfbb49","e-bd41600ca7d2b75b"]},{"id":169844,"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-56f9a973a14d65f2","e-70624c7ff3bfbb49","e-bd41600ca7d2b75b"]},{"id":169845,"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-56f9a973a14d65f2","e-70624c7ff3bfbb49","e-bd41600ca7d2b75b"]},{"id":169846,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-70624c7ff3bfbb49"]},{"id":169847,"position":4,"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-56f9a973a14d65f2"]},{"id":169848,"position":5,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-56f9a973a14d65f2"]}],"region_exact":{},"incoming_edges":[{"id":"e-56f9a973a14d65f2","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-3c85c2a2c3ff061d","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; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"abc1c782680b030d28b6e0e18f755db0f294526846bbabb2052eae6f241fcc49","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":"previous_interlaces_next"}],"premises":[]},{"id":"e-70624c7ff3bfbb49","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-3c85c2a2c3ff061d","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"7a0186c464ad9556548477409eb07bdc413c7cac53d3ef8ae49e8568a057b4b4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-bd41600ca7d2b75b","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-3c85c2a2c3ff061d","premise_count":0,"theorem":"Row-hypergeometric rows: an exact row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, proved for every n by an invariant row-annihilator system of the rule, writes every row as U_0(n) x^v (or its reversal) times the image of (1 + x)^M(n) under a product of nonnegative multiplier sequences: C^k (C > 0); k -> M'!/(M' - k)!, whose exponential generating function is (1 + x)^M' (Polya--Schur, Theorem 7.1 (3) => (1) of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601: a sequence is a multiplier sequence when G(x) = sum_k lambda_k x^k / k! or G(-x) can be written C x^m e^(a x) prod_k (1 + alpha_k x) with a >= 0, alpha_k >= 0); k -> phi(k) for a polynomial phi with only real roots, all <= 0 (Laguerre's theorem, RealRooted isPFMultiplierSequence_eval_of_roots_nonpos); k -> 1/(alpha)_k for alpha > 0 (RealRooted isPFMultiplierSequence_inv_ascPochhammer, via the generalized Laguerre polynomials); products of PF multiplier sequences are PF multiplier sequences (RealRooted IsPFMultiplierSequence.mul) and map real-rooted polynomials with nonnegative coefficients to such polynomials (IsPFMultiplierSequence.diagonalOperator_isPF)","lean_route":null,"lean_declarations":["RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_inv_ascPochhammer","RealRooted.IsPFMultiplierSequence.mul","RealRooted.IsPFMultiplierSequence.diagonalOperator_isPF"],"certificate_hash":"a456778f6f53e7b7348d7a1bc4cccf8be033aa3e962acd019b98056d7c6e256e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-420f78b065506c43","kind":"oeis_match","node_a_id":"n-3c85c2a2c3ff061d","node_b_id":null,"fingerprint":null,"oeis_id":"A052268","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":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A052268","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-d1e35a1ac754be94","kind":"oeis_match","node_a_id":"n-3c85c2a2c3ff061d","node_b_id":null,"fingerprint":null,"oeis_id":"A380860","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A380860","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-dcdfa6e5937a36ca","kind":"oeis_match","node_a_id":"n-3c85c2a2c3ff061d","node_b_id":null,"fingerprint":null,"oeis_id":"A063945","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":1,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A063945","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A380860","relation":"identification"},{"oeis_id":"A052268","relation":"match_row_sums"},{"oeis_id":"A063945","relation":"match_row_sums"},{"oeis_id":"A380860","relation":"match_triangle"}],"bfiles":[{"node_id":"n-3c85c2a2c3ff061d","oeis_id":"A052268","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":20,"oeis_terms_available":20,"term_count":200,"raw_size":20992},{"node_id":"n-3c85c2a2c3ff061d","oeis_id":"A380860","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":24180}],"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:         8,         1;\n  2:        72,        17,         1;\n  3:       648,       225,        26,        1;\n  4:      5832,      2673,       459,       35,       1;\n  5:     52488,     29889,      6804,      774,      44,      1;\n  6:    472392,    321489,     91125,    13770,    1170,     53,     1;\n  7:   4251528,   3365793,   1141614,   215055,   24300,   1647,    62,    1;\n  8:  38263752,  34543665,  13640319,  3077109,  433755,  39123,  2205,   71,  1;\n  9: 344373768, 349156737, 157306536, 41334300, 6980904, 785862, 58968, 2844, 80, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (9*n-9+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 8 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((9*n - 9 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 8 + x; for(n = 2, N, my(i = n + 1); v[i] = ((9*n - 9 + (n - 1)*x)*v[i - 1])/(n - 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}},{"oeis_id":"A380860","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:         1;\n  1:         8,         1;\n  2:        72,        17,         1;\n  3:       648,       225,        26,        1;\n  4:      5832,      2673,       459,       35,       1;\n  5:     52488,     29889,      6804,      774,      44,      1;\n  6:    472392,    321489,     91125,    13770,    1170,     53,     1;\n  7:   4251528,   3365793,   1141614,   215055,   24300,   1647,    62,    1;\n  8:  38263752,  34543665,  13640319,  3077109,  433755,  39123,  2205,   71,  1;\n  9: 344373768, 349156737, 157306536, 41334300, 6980904, 785862, 58968, 2844, 80, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (9*n-9+(n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 8 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((9*n - 9 + (n - 1)*x)*P[n - 1, x])/(n - 1)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 8 + x; for(n = 2, N, my(i = n + 1); v[i] = ((9*n - 9 + (n - 1)*x)*v[i - 1])/(n - 1)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-3c85c2a2c3ff061d","steps":[],"edges":[],"text":"A380860"},"headline":"A380860: Triangle read by rows: T(n,m) (0<=m<=n) = number of positive n-digit numbers that have exactly m copies of a specific, previously selected positive base-10 digit among its digits.","chain":null}