Abstract
1. Introduction. Let a1 a2, …, am be a set of real non-negative numbers and let1.1 P(x) = a1x + a2x2 + … + amxm (am ≠ 0).Many combinatorial problems can be reduced to the study of numbers Bn generated by1.2.Some problems of this type were treated by Touchard (7), Jacobsthal (3), Chowla, Herstein, Moore and Scott (1; 2), and the present authors (4).
Publisher
Canadian Mathematical Society
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Khinchin Families and Hayman Class;Computational Methods and Function Theory;2021-10-29
2. Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products;Combinatorica;2019-07-12
3. Estimation Problems and Randomised Group Algorithms;Lecture Notes in Mathematics;2012-11-26
4. Bibliography;Average Case Analysis of Algorithms on Sequences;2011-10-14
5. Estimating the kth coefficient of (f(z))n when k is not too large;Journal of Mathematical Analysis and Applications;2007-10