1. INTRODUCTION
Behera and Panda [1] defined balancing numbers n as solutions of the
Diophantine equation 1+2+ … +(n−1) = (n+1) + (n+2) +…+ (n+r), calling r
the balancer corresponding to n. They also established many important
results on balancing numbers. Later on, Panda [12] identified many beautiful
properties of balancing numbers, some of which are equivalent to the
corresponding results on Fibonacci numbers, and some others are more
interesting than the corresponding results on Fibonacci numbers.
Subsequently, Liptai [7] added another interesting result to the theory of
balancing numbers by proving that the only balancing number in the
Fibonacci sequence is 1.