The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110364 Beginning with 2, prime numbers such that the successive differences are distinct Fibonacci numbers. 1

%I #10 Sep 03 2017 03:29:59

%S 2,3,5,13,47,191,46559,8944394323838023,8945942332593943,

%T 407305795913026496164667897,407305795913026497299571067,

%U 407305795913026497299571677

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

%C Comment from David Wasserman, Dec 01 2008: There is no room for the next term, which is

%C 18828075583602596462866526311206253798143927071100760220356261227542635072700383.

%p with(combinat): F:={seq(fibonacci(k),k=1..500)}: a[1]:=2: for m from 2 to 7 do p:=proc(n) if member(ithprime(n)-a[m-1],F)=true then ithprime(n) else fi end: a[m]:=[seq(p(n),n=1..5000)][1]: F:=F minus {a[m]-a[m-1]}: od: seq(a[m],m=1..7); # _Emeric Deutsch_, Jul 28 2005

%t s = 2; l = {2}; Print[s]; Do[m = 1; While[MemberQ[l, m] || !PrimeQ[s + Fibonacci[m]], m++ ]; AppendTo[l, m]; s += Fibonacci[m]; Print[s], {n, 100}] (* _Ryan Propper_, Jul 21 2006 *)

%Y Cf. A110363.

%K easy,nonn

%O 1,1

%A _Amarnath Murthy_, Jul 23 2005

%E 2 more terms from _Emeric Deutsch_, Jul 28 2005

%E More terms from _Ryan Propper_, Jul 21 2006

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.

Last modified June 13 23:50 EDT 2024. Contains 373391 sequences. (Running on oeis4.)