35416

Appears in sequences

• a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.at n=18A063758
• a(n) = 2*(3*n+1)*(9*n+8).at n=25A304506
• a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n).at n=50A387775