共 26 条
[1]
Boyd DW(1975)The asymptotic number of solutions of a diophantine equation from coding theory J. Combin. Theory Ser. A 18 210-215
[2]
de Bruijn NG(1948)On Mahler’s partition problem Nederl. Akad. Wetensch. Proc. 51 659-669
[3]
Eaves RE(1970)A sufficient condition for the convergence of an infinite determinant SIAM J. Appl. Math. 18 652-657
[4]
Elsholtz C(2013)The number of Huffman codes, compact trees, and sums of unit fractions IEEE Trans. Inf. Theory 59 1065-1075
[5]
Heuberger C(1990)Singularity analysis of generating functions SIAM J. Discrete Math. 3 216-240
[6]
Prodinger H(1987)Level number sequences for trees Discrete Math. 65 149-156
[7]
Flajolet P(2013)Representation of a 2-power as sum of J. Number Theory 133 1251-1261
[8]
Odlyzko A(1998) 2-powers: a recursive formula Ann. Appl. Probab. 8 163-181
[9]
Flajolet P(1998)Large deviations of combinatorial distributions. II. Local limit theorems Eur. J. Combin. 19 329-343
[10]
Prodinger H(1966)On convergence rates in the central limit theorems for combinatorial structures Fibonacci Q. 4 117-128