login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079677 Distance from F(n) to closest prime, where F(n) is the n-th Fibonacci number. 3

%I

%S 2,1,1,0,0,0,1,0,2,3,2,0,5,0,2,3,4,0,5,4,2,3,2,0,13,4,10,11,14,0,23,4,

%T 4,9,10,14,11,6,12,3,2,6,7,0,16,9,24,0,5,20,18,23,14,6,9,12,10,21,4,

%U 30,13,38,4,7,16,12,19,36,22,31,4,32,11,12,60,7,2,6,27,12,62,25,20,0,19,78,6

%N Distance from F(n) to closest prime, where F(n) is the n-th Fibonacci number.

%H T. D. Noe, <a href="/A079677/b079677.txt">Table of n, a(n) for n = 0..1000</a>

%t Table[f = Fibonacci[n]; If[PrimeQ[f], 0, Min[f - NextPrime[f, -1], NextPrime[f] - f]], {n, 0, 100}] (* _T. D. Noe, May 02 2012 *)

%o (PARI) a(s)=min(abs(precprime(fibonacci(s))-fibonacci(s)),abs(nextprime(fibonacci(s))-fibonacci(s)))

%Y Cf. A051699, A000045.

%K nonn

%O 0,1

%A _Benoit Cloitre_, Jan 26 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 00:43 EDT 2019. Contains 325228 sequences. (Running on oeis4.)