A system of recurrence relations for rational approximations of the Euler constant.

We obtain the system of recurrence relations for rational approximations of the Euler constant generalizing the recurrence relations obtained earlier by Aptekarev with coauthors. The leading coefficient of the recurrence relations of this system is 1, which can be used to verify that the generated numbers are integers. [ABSTRACT FROM AUTHOR]