斐波那契数列
In particular, for "n" greater than 12, the "n"th Fibonacci number F("n") has at least one prime divisor that does not divide any earlier Fibonacci number.