login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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
Sequence in context: A281989 A328423 A070211 * A024457 A117842 A067588
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)