Аннотация
Many special functions are defined by differential equations, but useful arithmetic continued fractions often come from their discrete recurrences. This paper studied Riccati-type recurrences and their continued-fraction expansions in the setting of machine-discovered patterns from the enumerated signed-continued-fraction Massey approve algorithm (ESMA). The main contribution was a block method for Riccati recurrences, which was used to prove identities for signed interlaced continued fractions with affine partial denominators. We showed that several ESMA-type conjectures can be reduced to finite matrix identities in the block index. Three representative identities were proved in detail. They involved modified Bessel functions, half-integer Bessel functions, and ratios of integer-order Bessel functions. We also gave positivity checks and computable tail estimates. These estimates justified the passage to the infinite limit and gave explicit truncation bounds. The results showed that the representative formulas studied here were not isolated numerical coincidences.