Generating functions are very useful tool to solve various counting problems. One way in which this is done, is to evaluate the generating function at complex values (see e.g. this video of 3b1b). Are there cases where one can evaluate a generating function at $p$-adic numbers to gain information about a combinatorial problem?
PS: there is famously a $p$-adic analogue of the Riemann zeta function, but I'm looking at simpler instances.