Efficient computation of Favard constants and their connection to Euler polynomials and numbers

We discuss problems of calculating the Favard constants, which are often used in approximation theory and their connection to Euler numbers and polynomials. Simple effective recurrence formulas for computation of the Favard constants are found. The application of the results to one problem of extremal functional interpolation allowing the solution to be expressed in an explicit form is demonstrated.