cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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, 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, 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
Offset: 0

Views

Author

Benoit Cloitre, Jan 26 2003

Keywords

Crossrefs

Programs

  • Mathematica
    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 *)
  • PARI
    a(s)=min(abs(precprime(fibonacci(s))-fibonacci(s)),abs(nextprime(fibonacci(s))-fibonacci(s)))