Let G be a simple connected graph. The reciprocal distance spectrum of G is the multiset of reciprocal distance eigenvalues of G. The Indu-Bala product G \blacktriangledown H of two graphs G and H is obtained from two disjoint copies of the join G \vee H of G and H by joining the corresponding vertices in the two copies of H. In this paper we obtain the reciprocal distance spectrum of G \blacktriangledown H in terms of adjacency eigenvalues of G and H. We also construct infinitely many non-isomorphic pairs of reciprocal distance equienergetic graphs and reciprocal distance cospectral graphs of diameter 3.