103718

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (primes).at n=29A025088
• a(0) = a(1) = 0; thereafter a(n) = a(n-1)*a(n-2) + 2.at n=8A142471
• Numbers k such that (148*10^k - 1)/3 is prime.at n=26A274331