The number of reachable pairs in a digraph

For a digraph G, let R(G) (respectively, R^(^k^)(G)) be the number of ordered pairs (u,v) of vertices of G such that u v and v is reachable from u (respectively, reachable from u by a path of length ==k+(k+1)^0^.^5^7+2, for arbitrary k.