Create e14.java

This program computes the longest path length for the Collatz Conjecture where the starting number is below n.  This path is defined by the following: n = n/2 (if n is even) and n = 3*n + 1 (if n is odd)