180967

Appears in sequences

• a(0) = a(1) = 1, a(n) is the smallest positive integer m >= a(n-1) + a(n-2) such that gcd(a(k),m) = 1 for all 1 < k <= n - 1.at n=25A345471