108607

Appears in sequences

• Numbers n such that all of n^3+{2,4,6,10}^2 are primes.at n=4A125036
• a(n) = number of steps required to reach 0 from F(n+2) by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...at n=28A261082