One major theme of this paper concerns the expansion of modular forms and functions in terms of fractional (Puiseux) series. This theme is connected with another major theme, holonomic functions and sequences. With particular attention to algorithmic aspects, we study various connections between these two worlds. Applications concern partition congruences, Fricke–Klein relations, irrationality proofs a la Beukers, or approximations to pi studied by Ramanujan and the Borweins. As a major ingredient to a “first guess, then prove” strategy, a new algorithm for proving differential equations for modular forms is introduced.