167899

Properties

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=31A024468
• 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=30A025088
• a(n) = the n-th prime with sum of decimal digits = n, or 0 if no such number exists.at n=39A075361
• Duplicate of A075361.at n=39A082258
• a(1) = 2, a(2) = 3; for n > 0, a(n+2) is the smallest prime chosen so that (a(n+2) - a(n+1))/(a(n+1) - a(n)) is an integer.at n=22A084736
• Primes generated by pairwise averages of terms in A115760.at n=34A115782
• Prime numbersat n=15332