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!)
A110363 Beginning with 2, prime numbers such that successive differences are Fibonacci numbers. 1

%I #7 Sep 03 2017 03:29:50

%S 2,3,5,7,41,43,653,661,14931013,14931157,2880067194385747277,

%T 2880067194385747279,555565404227172761598401539087,

%U 370959230771131880927453873620406224662533776582329191

%N Beginning with 2, prime numbers such that successive differences are Fibonacci numbers.

%p with(combinat): a[1]:=2: for n from 2 to 15 do p:=proc(k) if isprime(a[n-1]+fibonacci(k))=true then a[n-1]+fibonacci(k) else fi end: a[n]:=[seq(p(k),k=1..500)][1] od: seq(a[n],n=1..15); # _Emeric Deutsch_, Jul 28 2005

%Y Cf. A110364.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Jul 23 2005

%E More terms from _Emeric Deutsch_, Jul 28 2005

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 June 24 18:26 EDT 2024. Contains 373688 sequences. (Running on oeis4.)