Sums of powers of binomial coefficients

An asymptotic series for sums of powers of binomial coefficients is derived, the general term being defined and usable with a computer symbolic language. Sums of squares of coefficients in the symmetric case are shown to have a link with classical moment problems, but this property breaks down for cubes and higher powers. Problems of remainders for the asymptotic series are mentioned. Using the reflection formula for I'(.), a continuous form for a binomial function is set up, and this becomes oscillatory outstde the usual range. A new contmued fraction emerges for the logarithm of an adjusted sum of binomial squares. The note is a contribution to the problem of the interpretation of asymptotic series and processes for their convergence acceleration.