Let \( A = \{ 1, 2, 3, \ldots , 100 \} \) and \( R \) be a relation on \( A \) such that \( R = \{ (a,b) : a = 2b + 1 \} \). Let \( (a_{1}, a_{2}), (a_{2}, a_{3}), (a_{3}, a_{4}), \ldots , (a_{k}, a_{k+1}) \) be a sequence of \( k \) elements of \( R \) such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer \( k \), for which such a sequence exists, is equal to: