login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A113753
a(n) = Fibonacci(n-1) + prime(n).
0
2, 4, 6, 9, 14, 18, 25, 32, 44, 63, 86, 126, 185, 276, 424, 663, 1046, 1658, 2651, 4252, 6838, 11025, 17794, 28746, 46465, 75126, 121496, 196525, 317920, 514342, 832167, 1346400, 2178446, 3524717, 5703036, 9227616, 14930509, 24157980, 39088336
OFFSET
1,1
EXAMPLE
a(4) = 9 because the 4th prime is 7 and F(4) is 2. a(4) = 7 + 2 = 9.
MAPLE
with(combinat, fibonacci): for n to 10^3 do print(fibonacci(n - 1) + ithprime(n)) end do; # Reza K Ghazi, May 14 2021
MATHEMATICA
Do[Print[Fibonacci[n - 1] + Prime[n]], {n, 10^3}] (* Reza K Ghazi, May 14, 2021*)
PROG
(PARI) for(n=1, 1e3, print1(fibonacci(n-1)+prime(n)", ")) \\ Reza K Ghazi, May 14 2021
(SageMath)
p = 0
for n in range(1, 10^3+1):
print(fibonacci(n-1) + next_prime(p))
p = next_prime(p) # Reza K Ghazi, May 14 2021
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Mark Dowdey (mdowdey(AT)comcast.net), Jan 18 2006
EXTENSIONS
Name corrected by Reza K Ghazi, May 15 2021
STATUS
approved