User blog comment:Deedlit11/Bignum Bakeoff appetizer/@comment-1605058-20140915172750

int n=0; while(n!=n+1){n++} return n;

This will return the first integer such that n=n+1, which must be Robinson number, which is the largest!