12649198

Appears in sequences

• Combinatorial prime formulas. This sequence gives the coefficients a(n) of combinatorial sum formulas of n-th primes or lesser: prime(n) = 2^(n-5)/(n-1)! Sum_{i=1..n} a(i) * C(n-1,i-1) * (1-(n-i)/2).at n=11A120315
• a(n) is the least integer k such that k/Fibonacci(n) > 1/5.at n=39A293637