How “hard” is it in general to show whether two formulae are equivalent, assuming that they are written using unambiguous notation?

Context: would it be practical to mechanically extract and process the formulae from page of the Online Encyclopaedia of Integer Sequences and use substitution to show relationships between them? E.g., discover instances where A0000x(n)==A0000y(A0000z(n)) and so on.