Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equationis an elliptic divisibility sequence, an important class of non-linear recurrences. We prove that the above equation admits only finitely many solutions. In fact, we present an algorithm to find all possible solutions, provided that the set of ℓ-th powers in B is given. (Note that this set is known to be finite.) We illustrate our method by an example.2010 Mathematics Subject Classification. primary 11D99; secondary 11B37.Key words and phrases. perfect powers in products, elliptic divisibility sequence. L.